./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 6c24879c 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-?-6c24879 [2022-07-12 19:26:23,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:26:23,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:26:23,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:26:23,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:26:23,456 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:26:23,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:26:23,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:26:23,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:26:23,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:26:23,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:26:23,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:26:23,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:26:23,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:26:23,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:26:23,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:26:23,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:26:23,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:26:23,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:26:23,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:26:23,478 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:26:23,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:26:23,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:26:23,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:26:23,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:26:23,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:26:23,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:26:23,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:26:23,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:26:23,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:26:23,493 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:26:23,493 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:26:23,494 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:26:23,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:26:23,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:26:23,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:26:23,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:26:23,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:26:23,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:26:23,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:26:23,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:26:23,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:26:23,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 19:26:23,516 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:26:23,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:26:23,523 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:26:23,523 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:26:23,524 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:26:23,524 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:26:23,525 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:26:23,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:26:23,525 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:26:23,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:26:23,526 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:26:23,526 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:26:23,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:26:23,526 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:26:23,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:26:23,527 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:26:23,527 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:26:23,527 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:26:23,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:26:23,528 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:26:23,528 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:26:23,528 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:26:23,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:26:23,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:26:23,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:26:23,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:26:23,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:26:23,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:26:23,529 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 19:26:23,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 19:26:23,530 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-12 19:26:23,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:26:23,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:26:23,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:26:23,769 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:26:23,770 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:26:23,771 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-12 19:26:23,819 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a70989b6/9340996fa5ad42aebfdb370156496dee/FLAG7b979693c [2022-07-12 19:26:24,178 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:26:24,178 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2022-07-12 19:26:24,208 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a70989b6/9340996fa5ad42aebfdb370156496dee/FLAG7b979693c [2022-07-12 19:26:24,572 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a70989b6/9340996fa5ad42aebfdb370156496dee [2022-07-12 19:26:24,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:26:24,574 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:26:24,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:26:24,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:26:24,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:26:24,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:26:24" (1/1) ... [2022-07-12 19:26:24,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@601a76a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:24, skipping insertion in model container [2022-07-12 19:26:24,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:26:24" (1/1) ... [2022-07-12 19:26:24,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:26:24,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:26:24,791 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-12 19:26:24,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:26:24,811 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:26:24,854 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-12 19:26:24,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:26:24,865 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:26:24,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:24 WrapperNode [2022-07-12 19:26:24,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:26:24,868 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:26:24,868 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:26:24,868 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:26:24,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:24" (1/1) ... [2022-07-12 19:26:24,883 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:24" (1/1) ... [2022-07-12 19:26:24,910 INFO L137 Inliner]: procedures = 29, calls = 44, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 663 [2022-07-12 19:26:24,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:26:24,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:26:24,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:26:24,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:26:24,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:24" (1/1) ... [2022-07-12 19:26:24,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:24" (1/1) ... [2022-07-12 19:26:24,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:24" (1/1) ... [2022-07-12 19:26:24,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:24" (1/1) ... [2022-07-12 19:26:24,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:24" (1/1) ... [2022-07-12 19:26:24,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:24" (1/1) ... [2022-07-12 19:26:24,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:24" (1/1) ... [2022-07-12 19:26:24,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:26:24,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:26:24,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:26:24,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:26:24,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:24" (1/1) ... [2022-07-12 19:26:24,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:26:24,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:26:24,995 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-12 19:26:25,026 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-12 19:26:25,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:26:25,041 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-07-12 19:26:25,041 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-07-12 19:26:25,041 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-12 19:26:25,042 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-12 19:26:25,042 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-07-12 19:26:25,042 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-07-12 19:26:25,042 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-12 19:26:25,042 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-12 19:26:25,042 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-12 19:26:25,042 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-12 19:26:25,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 19:26:25,043 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-12 19:26:25,043 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-12 19:26:25,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:26:25,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:26:25,044 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-07-12 19:26:25,044 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-07-12 19:26:25,158 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:26:25,159 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:26:25,268 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:26:25,276 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:26:25,277 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:26:25,281 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:26:25,284 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:26:25,554 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume !false; [2022-07-12 19:26:25,555 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume false; [2022-07-12 19:26:25,555 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##63: assume !false; [2022-07-12 19:26:25,555 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume false; [2022-07-12 19:26:25,555 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume false; [2022-07-12 19:26:25,555 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !false; [2022-07-12 19:26:25,555 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-07-12 19:26:25,555 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-07-12 19:26:25,556 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume !false; [2022-07-12 19:26:25,556 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume false; [2022-07-12 19:26:25,562 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:26:25,577 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-07-12 19:26:25,578 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-07-12 19:26:25,583 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:26:25,591 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:26:25,592 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 19:26:25,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:26:25 BoogieIcfgContainer [2022-07-12 19:26:25,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:26:25,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:26:25,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:26:25,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:26:25,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:26:24" (1/3) ... [2022-07-12 19:26:25,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64cbec90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:26:25, skipping insertion in model container [2022-07-12 19:26:25,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:24" (2/3) ... [2022-07-12 19:26:25,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64cbec90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:26:25, skipping insertion in model container [2022-07-12 19:26:25,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:26:25" (3/3) ... [2022-07-12 19:26:25,601 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2022-07-12 19:26:25,611 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:26:25,612 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 19:26:25,655 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:26:25,661 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@28c9850c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4626ba73 [2022-07-12 19:26:25,661 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-12 19:26:25,666 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-12 19:26:25,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 19:26:25,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:25,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:26:25,672 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:25,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:25,683 INFO L85 PathProgramCache]: Analyzing trace with hash -15799092, now seen corresponding path program 1 times [2022-07-12 19:26:25,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:25,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255417287] [2022-07-12 19:26:25,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:25,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:25,844 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-12 19:26:25,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:25,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255417287] [2022-07-12 19:26:25,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255417287] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:25,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:25,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:26:25,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671564798] [2022-07-12 19:26:25,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:25,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:25,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:25,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:25,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:25,877 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-12 19:26:25,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:25,953 INFO L93 Difference]: Finished difference Result 212 states and 315 transitions. [2022-07-12 19:26:25,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:25,956 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-12 19:26:25,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:25,970 INFO L225 Difference]: With dead ends: 212 [2022-07-12 19:26:25,971 INFO L226 Difference]: Without dead ends: 208 [2022-07-12 19:26:25,973 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-12 19:26:25,977 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-12 19:26:25,978 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-12 19:26:25,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-12 19:26:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2022-07-12 19:26:26,027 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-12 19:26:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 310 transitions. [2022-07-12 19:26:26,037 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 310 transitions. Word has length 8 [2022-07-12 19:26:26,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:26,038 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 310 transitions. [2022-07-12 19:26:26,039 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-12 19:26:26,039 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 310 transitions. [2022-07-12 19:26:26,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 19:26:26,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:26,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:26:26,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 19:26:26,041 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:26,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:26,042 INFO L85 PathProgramCache]: Analyzing trace with hash -191249986, now seen corresponding path program 1 times [2022-07-12 19:26:26,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:26,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864334309] [2022-07-12 19:26:26,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:26,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:26,100 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-12 19:26:26,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:26,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864334309] [2022-07-12 19:26:26,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864334309] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:26,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:26,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:26:26,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807532686] [2022-07-12 19:26:26,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:26,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:26,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:26,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:26,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:26,110 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-12 19:26:26,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:26,149 INFO L93 Difference]: Finished difference Result 205 states and 309 transitions. [2022-07-12 19:26:26,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:26,149 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-12 19:26:26,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:26,151 INFO L225 Difference]: With dead ends: 205 [2022-07-12 19:26:26,151 INFO L226 Difference]: Without dead ends: 201 [2022-07-12 19:26:26,151 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-12 19:26:26,152 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-12 19:26:26,153 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-12 19:26:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-12 19:26:26,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-07-12 19:26:26,165 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-12 19:26:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 296 transitions. [2022-07-12 19:26:26,166 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 296 transitions. Word has length 15 [2022-07-12 19:26:26,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:26,166 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 296 transitions. [2022-07-12 19:26:26,166 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-12 19:26:26,166 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 296 transitions. [2022-07-12 19:26:26,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 19:26:26,167 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:26,167 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-12 19:26:26,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 19:26:26,167 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:26,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:26,168 INFO L85 PathProgramCache]: Analyzing trace with hash 509601447, now seen corresponding path program 1 times [2022-07-12 19:26:26,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:26,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118153821] [2022-07-12 19:26:26,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:26,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:26,230 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-12 19:26:26,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:26,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118153821] [2022-07-12 19:26:26,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118153821] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:26,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:26,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:26:26,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527626371] [2022-07-12 19:26:26,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:26,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:26,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:26,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:26,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:26,232 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-12 19:26:26,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:26,317 INFO L93 Difference]: Finished difference Result 269 states and 381 transitions. [2022-07-12 19:26:26,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:26,318 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-12 19:26:26,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:26,319 INFO L225 Difference]: With dead ends: 269 [2022-07-12 19:26:26,319 INFO L226 Difference]: Without dead ends: 268 [2022-07-12 19:26:26,319 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-12 19:26:26,320 INFO L413 NwaCegarLoop]: 327 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, 436 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-12 19:26:26,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 436 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:26:26,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-12 19:26:26,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 252. [2022-07-12 19:26:26,330 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-12 19:26:26,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 361 transitions. [2022-07-12 19:26:26,331 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 361 transitions. Word has length 19 [2022-07-12 19:26:26,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:26,332 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 361 transitions. [2022-07-12 19:26:26,332 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-12 19:26:26,332 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 361 transitions. [2022-07-12 19:26:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 19:26:26,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:26,333 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-12 19:26:26,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 19:26:26,333 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:26,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:26,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2016043468, now seen corresponding path program 1 times [2022-07-12 19:26:26,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:26,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462574830] [2022-07-12 19:26:26,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:26,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:26,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:26,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:26,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462574830] [2022-07-12 19:26:26,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462574830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:26,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:26,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:26:26,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221387430] [2022-07-12 19:26:26,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:26,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:26,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:26,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:26,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:26,389 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-12 19:26:26,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:26,401 INFO L93 Difference]: Finished difference Result 312 states and 436 transitions. [2022-07-12 19:26:26,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:26,401 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-12 19:26:26,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:26,403 INFO L225 Difference]: With dead ends: 312 [2022-07-12 19:26:26,403 INFO L226 Difference]: Without dead ends: 312 [2022-07-12 19:26:26,403 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-12 19:26:26,404 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-12 19:26:26,404 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-12 19:26:26,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-12 19:26:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 290. [2022-07-12 19:26:26,427 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-12 19:26:26,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 410 transitions. [2022-07-12 19:26:26,430 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 410 transitions. Word has length 18 [2022-07-12 19:26:26,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:26,430 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 410 transitions. [2022-07-12 19:26:26,430 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-12 19:26:26,430 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 410 transitions. [2022-07-12 19:26:26,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 19:26:26,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:26,432 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-12 19:26:26,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 19:26:26,432 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:26,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1363549369, now seen corresponding path program 1 times [2022-07-12 19:26:26,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:26,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799435361] [2022-07-12 19:26:26,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:26,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:26,480 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-12 19:26:26,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:26,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799435361] [2022-07-12 19:26:26,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799435361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:26,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:26,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:26:26,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920628980] [2022-07-12 19:26:26,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:26,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:26,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:26,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:26,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:26,482 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-12 19:26:26,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:26,524 INFO L93 Difference]: Finished difference Result 289 states and 407 transitions. [2022-07-12 19:26:26,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:26,525 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-12 19:26:26,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:26,528 INFO L225 Difference]: With dead ends: 289 [2022-07-12 19:26:26,529 INFO L226 Difference]: Without dead ends: 289 [2022-07-12 19:26:26,529 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-12 19:26:26,532 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-12 19:26:26,533 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-12 19:26:26,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-12 19:26:26,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2022-07-12 19:26:26,545 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-12 19:26:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 407 transitions. [2022-07-12 19:26:26,547 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 407 transitions. Word has length 29 [2022-07-12 19:26:26,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:26,547 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 407 transitions. [2022-07-12 19:26:26,547 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-12 19:26:26,548 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 407 transitions. [2022-07-12 19:26:26,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 19:26:26,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:26,553 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-12 19:26:26,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 19:26:26,553 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:26,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:26,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1270637010, now seen corresponding path program 1 times [2022-07-12 19:26:26,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:26,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19476212] [2022-07-12 19:26:26,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:26,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:26,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 19:26:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:26,653 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-12 19:26:26,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:26,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19476212] [2022-07-12 19:26:26,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19476212] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:26,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:26,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:26:26,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428530875] [2022-07-12 19:26:26,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:26,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:26:26,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:26,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:26:26,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:26:26,655 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-12 19:26:26,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:26,807 INFO L93 Difference]: Finished difference Result 307 states and 427 transitions. [2022-07-12 19:26:26,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:26:26,808 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-12 19:26:26,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:26,809 INFO L225 Difference]: With dead ends: 307 [2022-07-12 19:26:26,809 INFO L226 Difference]: Without dead ends: 306 [2022-07-12 19:26:26,810 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-12 19:26:26,810 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:26,810 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.1s Time] [2022-07-12 19:26:26,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-12 19:26:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2022-07-12 19:26:26,816 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-12 19:26:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 422 transitions. [2022-07-12 19:26:26,817 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 422 transitions. Word has length 33 [2022-07-12 19:26:26,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:26,817 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 422 transitions. [2022-07-12 19:26:26,818 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-12 19:26:26,818 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 422 transitions. [2022-07-12 19:26:26,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:26:26,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:26,819 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-12 19:26:26,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 19:26:26,819 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:26,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:26,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1113906492, now seen corresponding path program 1 times [2022-07-12 19:26:26,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:26,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303888274] [2022-07-12 19:26:26,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:26,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:26,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 19:26:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:26,890 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-12 19:26:26,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:26,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303888274] [2022-07-12 19:26:26,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303888274] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:26,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:26,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:26:26,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142070982] [2022-07-12 19:26:26,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:26,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:26:26,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:26,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:26:26,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:26:26,893 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-12 19:26:27,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:27,033 INFO L93 Difference]: Finished difference Result 306 states and 425 transitions. [2022-07-12 19:26:27,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:26:27,033 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-12 19:26:27,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:27,036 INFO L225 Difference]: With dead ends: 306 [2022-07-12 19:26:27,036 INFO L226 Difference]: Without dead ends: 306 [2022-07-12 19:26:27,037 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-12 19:26:27,038 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-12 19:26:27,038 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-12 19:26:27,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-12 19:26:27,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2022-07-12 19:26:27,046 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-12 19:26:27,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 421 transitions. [2022-07-12 19:26:27,047 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 421 transitions. Word has length 34 [2022-07-12 19:26:27,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:27,048 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 421 transitions. [2022-07-12 19:26:27,048 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-12 19:26:27,048 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 421 transitions. [2022-07-12 19:26:27,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:26:27,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:27,051 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-12 19:26:27,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 19:26:27,051 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:27,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:27,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2136327390, now seen corresponding path program 1 times [2022-07-12 19:26:27,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:27,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124345630] [2022-07-12 19:26:27,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:27,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:27,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 19:26:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:27,087 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-12 19:26:27,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:27,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124345630] [2022-07-12 19:26:27,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124345630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:27,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:27,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:26:27,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159129356] [2022-07-12 19:26:27,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:27,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:26:27,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:27,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:26:27,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:26:27,089 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-12 19:26:27,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:27,203 INFO L93 Difference]: Finished difference Result 282 states and 385 transitions. [2022-07-12 19:26:27,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:26:27,204 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-12 19:26:27,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:27,206 INFO L225 Difference]: With dead ends: 282 [2022-07-12 19:26:27,206 INFO L226 Difference]: Without dead ends: 282 [2022-07-12 19:26:27,206 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-12 19:26:27,208 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-12 19:26:27,210 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-12 19:26:27,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-12 19:26:27,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 268. [2022-07-12 19:26:27,217 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-12 19:26:27,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 370 transitions. [2022-07-12 19:26:27,218 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 370 transitions. Word has length 34 [2022-07-12 19:26:27,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:27,219 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 370 transitions. [2022-07-12 19:26:27,219 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-12 19:26:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 370 transitions. [2022-07-12 19:26:27,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:26:27,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:27,220 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-12 19:26:27,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 19:26:27,220 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:27,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:27,221 INFO L85 PathProgramCache]: Analyzing trace with hash -2069817048, now seen corresponding path program 1 times [2022-07-12 19:26:27,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:27,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122603567] [2022-07-12 19:26:27,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:27,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:27,264 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-12 19:26:27,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:27,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122603567] [2022-07-12 19:26:27,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122603567] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:27,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:27,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:26:27,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826181123] [2022-07-12 19:26:27,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:27,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:26:27,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:27,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:26:27,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:26:27,267 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-12 19:26:27,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:27,339 INFO L93 Difference]: Finished difference Result 290 states and 394 transitions. [2022-07-12 19:26:27,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:26:27,340 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-12 19:26:27,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:27,341 INFO L225 Difference]: With dead ends: 290 [2022-07-12 19:26:27,341 INFO L226 Difference]: Without dead ends: 290 [2022-07-12 19:26:27,342 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-12 19:26:27,343 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 296 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12 19:26:27,344 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-12 19:26:27,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-12 19:26:27,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2022-07-12 19:26:27,348 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-12 19:26:27,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 368 transitions. [2022-07-12 19:26:27,349 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 368 transitions. Word has length 34 [2022-07-12 19:26:27,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:27,350 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 368 transitions. [2022-07-12 19:26:27,350 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-12 19:26:27,350 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 368 transitions. [2022-07-12 19:26:27,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 19:26:27,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:27,351 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-12 19:26:27,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 19:26:27,351 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:27,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:27,352 INFO L85 PathProgramCache]: Analyzing trace with hash -382146908, now seen corresponding path program 1 times [2022-07-12 19:26:27,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:27,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979845613] [2022-07-12 19:26:27,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:27,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:27,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 19:26:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:27,382 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-12 19:26:27,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:27,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979845613] [2022-07-12 19:26:27,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979845613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:27,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:27,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:26:27,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933527775] [2022-07-12 19:26:27,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:27,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:26:27,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:27,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:26:27,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:26:27,384 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-12 19:26:27,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:27,437 INFO L93 Difference]: Finished difference Result 262 states and 356 transitions. [2022-07-12 19:26:27,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:26:27,437 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-12 19:26:27,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:27,440 INFO L225 Difference]: With dead ends: 262 [2022-07-12 19:26:27,440 INFO L226 Difference]: Without dead ends: 232 [2022-07-12 19:26:27,440 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-12 19:26:27,441 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:27,441 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.0s Time] [2022-07-12 19:26:27,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-12 19:26:27,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 210. [2022-07-12 19:26:27,448 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-12 19:26:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 287 transitions. [2022-07-12 19:26:27,450 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 287 transitions. Word has length 35 [2022-07-12 19:26:27,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:27,452 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 287 transitions. [2022-07-12 19:26:27,452 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-12 19:26:27,452 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 287 transitions. [2022-07-12 19:26:27,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:26:27,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:27,454 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-12 19:26:27,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 19:26:27,454 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:27,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:27,455 INFO L85 PathProgramCache]: Analyzing trace with hash 758626562, now seen corresponding path program 1 times [2022-07-12 19:26:27,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:27,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539236542] [2022-07-12 19:26:27,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:27,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:27,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 19:26:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:27,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:26:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:27,507 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-12 19:26:27,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:27,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539236542] [2022-07-12 19:26:27,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539236542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:27,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:27,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:26:27,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592837935] [2022-07-12 19:26:27,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:27,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:26:27,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:27,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:26:27,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:26:27,510 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-12 19:26:27,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:27,590 INFO L93 Difference]: Finished difference Result 208 states and 283 transitions. [2022-07-12 19:26:27,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:26:27,591 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-12 19:26:27,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:27,592 INFO L225 Difference]: With dead ends: 208 [2022-07-12 19:26:27,592 INFO L226 Difference]: Without dead ends: 208 [2022-07-12 19:26:27,593 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-12 19:26:27,593 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 84 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12 19:26:27,593 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-12 19:26:27,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-12 19:26:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-07-12 19:26:27,597 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-12 19:26:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 283 transitions. [2022-07-12 19:26:27,598 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 283 transitions. Word has length 39 [2022-07-12 19:26:27,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:27,598 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 283 transitions. [2022-07-12 19:26:27,598 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-12 19:26:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 283 transitions. [2022-07-12 19:26:27,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:26:27,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:27,599 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-12 19:26:27,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 19:26:27,599 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:27,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:27,600 INFO L85 PathProgramCache]: Analyzing trace with hash 143802726, now seen corresponding path program 1 times [2022-07-12 19:26:27,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:27,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036324323] [2022-07-12 19:26:27,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:27,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:27,631 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-12 19:26:27,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:27,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036324323] [2022-07-12 19:26:27,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036324323] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:27,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:27,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:26:27,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256261073] [2022-07-12 19:26:27,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:27,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:26:27,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:27,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:26:27,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:26:27,633 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-12 19:26:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:27,677 INFO L93 Difference]: Finished difference Result 217 states and 292 transitions. [2022-07-12 19:26:27,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:26:27,678 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-12 19:26:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:27,679 INFO L225 Difference]: With dead ends: 217 [2022-07-12 19:26:27,679 INFO L226 Difference]: Without dead ends: 186 [2022-07-12 19:26:27,679 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-12 19:26:27,680 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-12 19:26:27,680 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-12 19:26:27,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-12 19:26:27,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-07-12 19:26:27,684 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-12 19:26:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 251 transitions. [2022-07-12 19:26:27,685 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 251 transitions. Word has length 37 [2022-07-12 19:26:27,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:27,685 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 251 transitions. [2022-07-12 19:26:27,686 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-12 19:26:27,686 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 251 transitions. [2022-07-12 19:26:27,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 19:26:27,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:27,687 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-12 19:26:27,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 19:26:27,687 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:27,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:27,687 INFO L85 PathProgramCache]: Analyzing trace with hash -233541237, now seen corresponding path program 1 times [2022-07-12 19:26:27,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:27,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80128932] [2022-07-12 19:26:27,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:27,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:27,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 19:26:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:27,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:26:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:27,773 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-12 19:26:27,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:27,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80128932] [2022-07-12 19:26:27,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80128932] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:27,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:27,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:26:27,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614452677] [2022-07-12 19:26:27,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:27,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:26:27,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:27,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:26:27,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:26:27,775 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-12 19:26:27,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:27,905 INFO L93 Difference]: Finished difference Result 211 states and 282 transitions. [2022-07-12 19:26:27,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:26:27,906 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-12 19:26:27,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:27,907 INFO L225 Difference]: With dead ends: 211 [2022-07-12 19:26:27,907 INFO L226 Difference]: Without dead ends: 204 [2022-07-12 19:26:27,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:26:27,907 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-12 19:26:27,908 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-12 19:26:27,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-12 19:26:27,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 194. [2022-07-12 19:26:27,911 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-12 19:26:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 260 transitions. [2022-07-12 19:26:27,912 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 260 transitions. Word has length 41 [2022-07-12 19:26:27,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:27,912 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 260 transitions. [2022-07-12 19:26:27,912 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-12 19:26:27,912 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 260 transitions. [2022-07-12 19:26:27,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:26:27,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:27,913 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-12 19:26:27,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 19:26:27,913 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:27,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:27,914 INFO L85 PathProgramCache]: Analyzing trace with hash 131822704, now seen corresponding path program 1 times [2022-07-12 19:26:27,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:27,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556034802] [2022-07-12 19:26:27,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:27,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:27,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 19:26:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:27,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:26:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:27,945 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-12 19:26:27,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:27,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556034802] [2022-07-12 19:26:27,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556034802] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:27,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:27,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:26:27,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195658978] [2022-07-12 19:26:27,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:27,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:26:27,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:27,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:26:27,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:26:27,947 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-12 19:26:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:28,024 INFO L93 Difference]: Finished difference Result 207 states and 273 transitions. [2022-07-12 19:26:28,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:26:28,025 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-12 19:26:28,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:28,026 INFO L225 Difference]: With dead ends: 207 [2022-07-12 19:26:28,026 INFO L226 Difference]: Without dead ends: 205 [2022-07-12 19:26:28,026 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-12 19:26:28,027 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-12 19:26:28,027 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-12 19:26:28,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-12 19:26:28,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 196. [2022-07-12 19:26:28,030 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-12 19:26:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 261 transitions. [2022-07-12 19:26:28,031 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 261 transitions. Word has length 42 [2022-07-12 19:26:28,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:28,032 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 261 transitions. [2022-07-12 19:26:28,032 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-12 19:26:28,032 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 261 transitions. [2022-07-12 19:26:28,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 19:26:28,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:28,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, 1] [2022-07-12 19:26:28,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 19:26:28,033 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:28,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:28,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1766604753, now seen corresponding path program 1 times [2022-07-12 19:26:28,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:28,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969479528] [2022-07-12 19:26:28,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:28,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:28,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 19:26:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:28,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:26:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:28,083 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-12 19:26:28,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:28,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969479528] [2022-07-12 19:26:28,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969479528] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:28,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:28,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:26:28,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51168412] [2022-07-12 19:26:28,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:28,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:26:28,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:28,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:26:28,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:26:28,085 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-12 19:26:28,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:28,217 INFO L93 Difference]: Finished difference Result 216 states and 286 transitions. [2022-07-12 19:26:28,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:26:28,217 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-12 19:26:28,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:28,218 INFO L225 Difference]: With dead ends: 216 [2022-07-12 19:26:28,218 INFO L226 Difference]: Without dead ends: 216 [2022-07-12 19:26:28,218 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-12 19:26:28,219 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-12 19:26:28,219 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-12 19:26:28,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-12 19:26:28,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 197. [2022-07-12 19:26:28,222 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-12 19:26:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 262 transitions. [2022-07-12 19:26:28,223 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 262 transitions. Word has length 43 [2022-07-12 19:26:28,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:28,224 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 262 transitions. [2022-07-12 19:26:28,224 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-12 19:26:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 262 transitions. [2022-07-12 19:26:28,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 19:26:28,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:28,225 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-12 19:26:28,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 19:26:28,225 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:28,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:28,225 INFO L85 PathProgramCache]: Analyzing trace with hash -446330305, now seen corresponding path program 1 times [2022-07-12 19:26:28,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:28,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461698804] [2022-07-12 19:26:28,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:28,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:28,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 19:26:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:28,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:26:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:28,263 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-12 19:26:28,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:28,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461698804] [2022-07-12 19:26:28,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461698804] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:28,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:28,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:26:28,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883543257] [2022-07-12 19:26:28,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:28,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:26:28,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:28,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:26:28,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:26:28,265 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-12 19:26:28,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:28,333 INFO L93 Difference]: Finished difference Result 194 states and 255 transitions. [2022-07-12 19:26:28,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:26:28,334 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-12 19:26:28,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:28,335 INFO L225 Difference]: With dead ends: 194 [2022-07-12 19:26:28,335 INFO L226 Difference]: Without dead ends: 186 [2022-07-12 19:26:28,335 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-12 19:26:28,335 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 67 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12 19:26:28,336 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-12 19:26:28,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-12 19:26:28,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2022-07-12 19:26:28,339 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-12 19:26:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 246 transitions. [2022-07-12 19:26:28,339 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 246 transitions. Word has length 43 [2022-07-12 19:26:28,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:28,340 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 246 transitions. [2022-07-12 19:26:28,340 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-12 19:26:28,340 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 246 transitions. [2022-07-12 19:26:28,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:26:28,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:28,341 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-12 19:26:28,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 19:26:28,341 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:28,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:28,341 INFO L85 PathProgramCache]: Analyzing trace with hash 694033782, now seen corresponding path program 1 times [2022-07-12 19:26:28,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:28,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003149662] [2022-07-12 19:26:28,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:28,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:28,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 19:26:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:28,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:26:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:28,409 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-12 19:26:28,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:28,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003149662] [2022-07-12 19:26:28,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003149662] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:28,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:28,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:26:28,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193454823] [2022-07-12 19:26:28,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:28,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:26:28,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:28,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:26:28,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:26:28,412 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-12 19:26:28,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:28,472 INFO L93 Difference]: Finished difference Result 178 states and 237 transitions. [2022-07-12 19:26:28,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:26:28,472 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-12 19:26:28,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:28,473 INFO L225 Difference]: With dead ends: 178 [2022-07-12 19:26:28,473 INFO L226 Difference]: Without dead ends: 178 [2022-07-12 19:26:28,473 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-12 19:26:28,474 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 79 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12 19:26:28,474 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-12 19:26:28,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-12 19:26:28,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-07-12 19:26:28,477 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-12 19:26:28,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 237 transitions. [2022-07-12 19:26:28,477 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 237 transitions. Word has length 44 [2022-07-12 19:26:28,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:28,478 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 237 transitions. [2022-07-12 19:26:28,478 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-12 19:26:28,478 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 237 transitions. [2022-07-12 19:26:28,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:26:28,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:28,479 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-12 19:26:28,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 19:26:28,479 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:28,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:28,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1239862159, now seen corresponding path program 1 times [2022-07-12 19:26:28,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:28,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574621333] [2022-07-12 19:26:28,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:28,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:28,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 19:26:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:28,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-12 19:26:28,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:28,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574621333] [2022-07-12 19:26:28,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574621333] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:28,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:28,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:26:28,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363637349] [2022-07-12 19:26:28,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:28,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:26:28,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:28,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:26:28,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:26:28,528 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-12 19:26:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:28,645 INFO L93 Difference]: Finished difference Result 176 states and 232 transitions. [2022-07-12 19:26:28,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:26:28,645 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-12 19:26:28,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:28,646 INFO L225 Difference]: With dead ends: 176 [2022-07-12 19:26:28,646 INFO L226 Difference]: Without dead ends: 176 [2022-07-12 19:26:28,646 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-12 19:26:28,647 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-12 19:26:28,647 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-12 19:26:28,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-12 19:26:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2022-07-12 19:26:28,650 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-12 19:26:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 230 transitions. [2022-07-12 19:26:28,650 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 230 transitions. Word has length 42 [2022-07-12 19:26:28,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:28,651 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 230 transitions. [2022-07-12 19:26:28,651 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-12 19:26:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 230 transitions. [2022-07-12 19:26:28,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:26:28,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:28,652 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-12 19:26:28,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 19:26:28,652 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:28,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:28,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1096582801, now seen corresponding path program 1 times [2022-07-12 19:26:28,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:28,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174835205] [2022-07-12 19:26:28,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:28,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:28,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 19:26:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:28,702 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-12 19:26:28,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:28,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174835205] [2022-07-12 19:26:28,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174835205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:28,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:28,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:26:28,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125313248] [2022-07-12 19:26:28,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:28,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:26:28,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:28,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:26:28,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:26:28,704 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-12 19:26:28,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:28,827 INFO L93 Difference]: Finished difference Result 185 states and 241 transitions. [2022-07-12 19:26:28,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:26:28,828 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-12 19:26:28,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:28,829 INFO L225 Difference]: With dead ends: 185 [2022-07-12 19:26:28,829 INFO L226 Difference]: Without dead ends: 169 [2022-07-12 19:26:28,829 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-12 19:26:28,829 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-12 19:26:28,830 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-12 19:26:28,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-12 19:26:28,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-07-12 19:26:28,833 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-12 19:26:28,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 223 transitions. [2022-07-12 19:26:28,833 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 223 transitions. Word has length 42 [2022-07-12 19:26:28,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:28,833 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 223 transitions. [2022-07-12 19:26:28,834 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-12 19:26:28,834 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 223 transitions. [2022-07-12 19:26:28,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 19:26:28,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:28,834 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-12 19:26:28,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 19:26:28,835 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:28,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:28,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1105542194, now seen corresponding path program 1 times [2022-07-12 19:26:28,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:28,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852396994] [2022-07-12 19:26:28,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:28,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:28,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 19:26:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:28,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:26:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:28,861 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-12 19:26:28,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:28,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852396994] [2022-07-12 19:26:28,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852396994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:28,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:28,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:26:28,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796895904] [2022-07-12 19:26:28,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:28,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:26:28,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:28,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:26:28,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:26:28,863 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-12 19:26:28,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:28,904 INFO L93 Difference]: Finished difference Result 170 states and 223 transitions. [2022-07-12 19:26:28,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:26:28,904 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-12 19:26:28,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:28,905 INFO L225 Difference]: With dead ends: 170 [2022-07-12 19:26:28,905 INFO L226 Difference]: Without dead ends: 168 [2022-07-12 19:26:28,905 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-12 19:26:28,906 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:28,906 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.0s Time] [2022-07-12 19:26:28,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-12 19:26:28,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-07-12 19:26:28,909 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-12 19:26:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 218 transitions. [2022-07-12 19:26:28,909 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 218 transitions. Word has length 48 [2022-07-12 19:26:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:28,909 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 218 transitions. [2022-07-12 19:26:28,910 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-12 19:26:28,910 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 218 transitions. [2022-07-12 19:26:28,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 19:26:28,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:28,910 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-12 19:26:28,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 19:26:28,911 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:28,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:28,911 INFO L85 PathProgramCache]: Analyzing trace with hash 364909914, now seen corresponding path program 1 times [2022-07-12 19:26:28,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:28,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138631928] [2022-07-12 19:26:28,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:28,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:28,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 19:26:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:28,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:26:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:28,970 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-12 19:26:28,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:28,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138631928] [2022-07-12 19:26:28,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138631928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:28,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:28,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 19:26:28,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527323104] [2022-07-12 19:26:28,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:28,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:26:28,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:28,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:26:28,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:26:28,972 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-12 19:26:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:29,099 INFO L93 Difference]: Finished difference Result 177 states and 227 transitions. [2022-07-12 19:26:29,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:26:29,100 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-12 19:26:29,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:29,100 INFO L225 Difference]: With dead ends: 177 [2022-07-12 19:26:29,100 INFO L226 Difference]: Without dead ends: 145 [2022-07-12 19:26:29,101 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-12 19:26:29,101 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-12 19:26:29,101 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-12 19:26:29,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-12 19:26:29,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-07-12 19:26:29,104 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-12 19:26:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 183 transitions. [2022-07-12 19:26:29,104 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 183 transitions. Word has length 49 [2022-07-12 19:26:29,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:29,105 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 183 transitions. [2022-07-12 19:26:29,105 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-12 19:26:29,105 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 183 transitions. [2022-07-12 19:26:29,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 19:26:29,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:26:29,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 19:26:29,106 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:29,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:29,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1292109318, now seen corresponding path program 1 times [2022-07-12 19:26:29,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:29,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043826945] [2022-07-12 19:26:29,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:29,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:29,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 19:26:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:29,161 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-12 19:26:29,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:29,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043826945] [2022-07-12 19:26:29,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043826945] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:29,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:29,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:26:29,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416329777] [2022-07-12 19:26:29,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:29,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:26:29,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:29,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:26:29,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:26:29,164 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-12 19:26:29,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:29,328 INFO L93 Difference]: Finished difference Result 192 states and 234 transitions. [2022-07-12 19:26:29,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:26:29,330 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-12 19:26:29,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:29,330 INFO L225 Difference]: With dead ends: 192 [2022-07-12 19:26:29,330 INFO L226 Difference]: Without dead ends: 180 [2022-07-12 19:26:29,331 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-12 19:26:29,331 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:29,331 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.1s Time] [2022-07-12 19:26:29,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-12 19:26:29,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 151. [2022-07-12 19:26:29,334 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-12 19:26:29,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 190 transitions. [2022-07-12 19:26:29,335 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 190 transitions. Word has length 43 [2022-07-12 19:26:29,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:29,335 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 190 transitions. [2022-07-12 19:26:29,335 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-12 19:26:29,336 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 190 transitions. [2022-07-12 19:26:29,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 19:26:29,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:29,336 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-12 19:26:29,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 19:26:29,337 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:29,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:29,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1608018874, now seen corresponding path program 1 times [2022-07-12 19:26:29,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:29,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519202902] [2022-07-12 19:26:29,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:29,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:29,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 19:26:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:29,377 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-12 19:26:29,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:29,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519202902] [2022-07-12 19:26:29,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519202902] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:29,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:29,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:26:29,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106151459] [2022-07-12 19:26:29,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:29,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:26:29,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:29,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:26:29,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:26:29,379 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-12 19:26:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:29,494 INFO L93 Difference]: Finished difference Result 162 states and 201 transitions. [2022-07-12 19:26:29,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:26:29,494 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-12 19:26:29,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:29,495 INFO L225 Difference]: With dead ends: 162 [2022-07-12 19:26:29,495 INFO L226 Difference]: Without dead ends: 129 [2022-07-12 19:26:29,495 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-12 19:26:29,496 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-12 19:26:29,496 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-12 19:26:29,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-12 19:26:29,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-12 19:26:29,498 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-12 19:26:29,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2022-07-12 19:26:29,499 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 43 [2022-07-12 19:26:29,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:29,499 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2022-07-12 19:26:29,499 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-12 19:26:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2022-07-12 19:26:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:26:29,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:29,500 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-12 19:26:29,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 19:26:29,500 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:29,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:29,501 INFO L85 PathProgramCache]: Analyzing trace with hash -825515977, now seen corresponding path program 1 times [2022-07-12 19:26:29,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:29,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20120090] [2022-07-12 19:26:29,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:29,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 19:26:29,513 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 19:26:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 19:26:29,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 19:26:29,538 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 19:26:29,539 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-07-12 19:26:29,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-07-12 19:26:29,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 19:26:29,543 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-12 19:26:29,546 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 19:26:29,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 07:26:29 BoogieIcfgContainer [2022-07-12 19:26:29,589 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 19:26:29,590 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 19:26:29,590 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 19:26:29,590 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 19:26:29,590 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:26:25" (3/4) ... [2022-07-12 19:26:29,592 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 19:26:29,592 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 19:26:29,592 INFO L158 Benchmark]: Toolchain (without parser) took 5018.06ms. Allocated memory was 90.2MB in the beginning and 146.8MB in the end (delta: 56.6MB). Free memory was 50.9MB in the beginning and 107.3MB in the end (delta: -56.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:26:29,593 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 90.2MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:26:29,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.67ms. Allocated memory was 90.2MB in the beginning and 121.6MB in the end (delta: 31.5MB). Free memory was 50.7MB in the beginning and 88.6MB in the end (delta: -37.9MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2022-07-12 19:26:29,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.97ms. Allocated memory is still 121.6MB. Free memory was 88.6MB in the beginning and 84.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 19:26:29,593 INFO L158 Benchmark]: Boogie Preprocessor took 36.60ms. Allocated memory is still 121.6MB. Free memory was 84.9MB in the beginning and 82.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:26:29,594 INFO L158 Benchmark]: RCFGBuilder took 645.88ms. Allocated memory is still 121.6MB. Free memory was 82.3MB in the beginning and 46.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-07-12 19:26:29,594 INFO L158 Benchmark]: TraceAbstraction took 3993.12ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 46.2MB in the beginning and 107.3MB in the end (delta: -61.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:26:29,594 INFO L158 Benchmark]: Witness Printer took 2.56ms. Allocated memory is still 146.8MB. Free memory is still 107.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:26:29,595 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 90.2MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.67ms. Allocated memory was 90.2MB in the beginning and 121.6MB in the end (delta: 31.5MB). Free memory was 50.7MB in the beginning and 88.6MB in the end (delta: -37.9MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.97ms. Allocated memory is still 121.6MB. Free memory was 88.6MB in the beginning and 84.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.60ms. Allocated memory is still 121.6MB. Free memory was 84.9MB in the beginning and 82.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 645.88ms. Allocated memory is still 121.6MB. Free memory was 82.3MB in the beginning and 46.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3993.12ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 46.2MB in the beginning and 107.3MB in the end (delta: -61.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.56ms. Allocated memory is still 146.8MB. Free memory is still 107.3MB. 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: 3.9s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3672 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3636 mSDsluCounter, 18049 SdHoareTripleChecker+Invalid, 1.3s 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, 5441 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.5s 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s 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-12 19:26:29,624 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-?-6c24879 [2022-07-12 19:26:31,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:26:31,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:26:31,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:26:31,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:26:31,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:26:31,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:26:31,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:26:31,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:26:31,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:26:31,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:26:31,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:26:31,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:26:31,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:26:31,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:26:31,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:26:31,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:26:31,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:26:31,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:26:31,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:26:31,356 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:26:31,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:26:31,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:26:31,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:26:31,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:26:31,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:26:31,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:26:31,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:26:31,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:26:31,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:26:31,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:26:31,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:26:31,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:26:31,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:26:31,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:26:31,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:26:31,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:26:31,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:26:31,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:26:31,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:26:31,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:26:31,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:26:31,374 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 19:26:31,400 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:26:31,400 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:26:31,400 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:26:31,401 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:26:31,401 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:26:31,401 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:26:31,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:26:31,402 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:26:31,402 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:26:31,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:26:31,403 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:26:31,407 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:26:31,407 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:26:31,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:26:31,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:26:31,408 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:26:31,408 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:26:31,408 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:26:31,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:26:31,408 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:26:31,408 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 19:26:31,409 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 19:26:31,409 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:26:31,409 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:26:31,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:26:31,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:26:31,409 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:26:31,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:26:31,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:26:31,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:26:31,410 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 19:26:31,410 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 19:26:31,411 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 19:26:31,411 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-12 19:26:31,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:26:31,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:26:31,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:26:31,646 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:26:31,647 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:26:31,648 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-12 19:26:31,703 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf13c8911/47bf384d1bef41e4a6d5964f9cebce1f/FLAGb1d5b010a [2022-07-12 19:26:32,130 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:26:32,132 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2022-07-12 19:26:32,144 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf13c8911/47bf384d1bef41e4a6d5964f9cebce1f/FLAGb1d5b010a [2022-07-12 19:26:32,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf13c8911/47bf384d1bef41e4a6d5964f9cebce1f [2022-07-12 19:26:32,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:26:32,165 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:26:32,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:26:32,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:26:32,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:26:32,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:26:32" (1/1) ... [2022-07-12 19:26:32,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a74382e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:32, skipping insertion in model container [2022-07-12 19:26:32,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:26:32" (1/1) ... [2022-07-12 19:26:32,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:26:32,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:26:32,434 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-12 19:26:32,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:26:32,449 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:26:32,504 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-12 19:26:32,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:26:32,515 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:26:32,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:32 WrapperNode [2022-07-12 19:26:32,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:26:32,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:26:32,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:26:32,517 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:26:32,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:32" (1/1) ... [2022-07-12 19:26:32,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:32" (1/1) ... [2022-07-12 19:26:32,574 INFO L137 Inliner]: procedures = 29, calls = 44, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 607 [2022-07-12 19:26:32,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:26:32,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:26:32,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:26:32,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:26:32,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:32" (1/1) ... [2022-07-12 19:26:32,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:32" (1/1) ... [2022-07-12 19:26:32,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:32" (1/1) ... [2022-07-12 19:26:32,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:32" (1/1) ... [2022-07-12 19:26:32,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:32" (1/1) ... [2022-07-12 19:26:32,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:32" (1/1) ... [2022-07-12 19:26:32,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:32" (1/1) ... [2022-07-12 19:26:32,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:26:32,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:26:32,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:26:32,628 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:26:32,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:32" (1/1) ... [2022-07-12 19:26:32,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:26:32,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:26:32,652 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-12 19:26:32,655 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-12 19:26:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:26:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-07-12 19:26:32,681 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-07-12 19:26:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 19:26:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-12 19:26:32,681 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-12 19:26:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-07-12 19:26:32,681 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-07-12 19:26:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-12 19:26:32,682 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-12 19:26:32,682 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-12 19:26:32,682 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-12 19:26:32,682 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-12 19:26:32,682 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-12 19:26:32,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:26:32,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:26:32,682 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-07-12 19:26:32,683 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-07-12 19:26:32,824 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:26:32,825 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:26:32,937 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:26:32,940 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:26:32,942 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:26:32,950 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:26:32,952 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:26:33,245 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume !false; [2022-07-12 19:26:33,245 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume false; [2022-07-12 19:26:33,245 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##63: assume !false; [2022-07-12 19:26:33,246 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume false; [2022-07-12 19:26:33,246 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume false; [2022-07-12 19:26:33,246 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !false; [2022-07-12 19:26:33,246 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-07-12 19:26:33,246 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-07-12 19:26:33,246 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume !false; [2022-07-12 19:26:33,246 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume false; [2022-07-12 19:26:33,260 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:26:33,279 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-07-12 19:26:33,280 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-07-12 19:26:33,287 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:26:33,294 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:26:33,295 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 19:26:33,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:26:33 BoogieIcfgContainer [2022-07-12 19:26:33,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:26:33,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:26:33,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:26:33,299 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:26:33,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:26:32" (1/3) ... [2022-07-12 19:26:33,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67258e74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:26:33, skipping insertion in model container [2022-07-12 19:26:33,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:32" (2/3) ... [2022-07-12 19:26:33,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67258e74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:26:33, skipping insertion in model container [2022-07-12 19:26:33,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:26:33" (3/3) ... [2022-07-12 19:26:33,301 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2022-07-12 19:26:33,310 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:26:33,310 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 19:26:33,351 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:26:33,358 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@29fc74a1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5962764b [2022-07-12 19:26:33,358 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-12 19:26:33,363 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-12 19:26:33,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 19:26:33,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:33,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:26:33,367 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:33,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:33,370 INFO L85 PathProgramCache]: Analyzing trace with hash -15799092, now seen corresponding path program 1 times [2022-07-12 19:26:33,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:33,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215860385] [2022-07-12 19:26:33,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:33,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:33,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:33,379 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-12 19:26:33,383 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-12 19:26:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:33,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:26:33,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:33,500 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-12 19:26:33,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:33,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:33,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215860385] [2022-07-12 19:26:33,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215860385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:33,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:33,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:26:33,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127090551] [2022-07-12 19:26:33,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:33,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:33,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:33,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:33,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:33,531 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-12 19:26:33,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:33,602 INFO L93 Difference]: Finished difference Result 212 states and 315 transitions. [2022-07-12 19:26:33,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:33,605 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-12 19:26:33,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:33,611 INFO L225 Difference]: With dead ends: 212 [2022-07-12 19:26:33,611 INFO L226 Difference]: Without dead ends: 208 [2022-07-12 19:26:33,612 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-12 19:26:33,615 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-12 19:26:33,615 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-12 19:26:33,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-12 19:26:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2022-07-12 19:26:33,656 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-12 19:26:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 310 transitions. [2022-07-12 19:26:33,660 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 310 transitions. Word has length 8 [2022-07-12 19:26:33,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:33,661 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 310 transitions. [2022-07-12 19:26:33,662 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-12 19:26:33,662 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 310 transitions. [2022-07-12 19:26:33,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 19:26:33,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:33,663 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:26:33,684 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-12 19:26:33,869 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-12 19:26:33,869 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:33,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:33,870 INFO L85 PathProgramCache]: Analyzing trace with hash -191249986, now seen corresponding path program 1 times [2022-07-12 19:26:33,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:33,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598134045] [2022-07-12 19:26:33,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:33,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:33,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:33,873 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-12 19:26:33,874 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-12 19:26:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:33,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:26:33,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:33,985 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-12 19:26:33,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:33,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:33,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598134045] [2022-07-12 19:26:33,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598134045] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:33,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:33,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:26:33,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031724602] [2022-07-12 19:26:33,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:33,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:33,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:33,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:33,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:33,992 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-12 19:26:34,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:34,036 INFO L93 Difference]: Finished difference Result 205 states and 309 transitions. [2022-07-12 19:26:34,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:34,036 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-12 19:26:34,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:34,038 INFO L225 Difference]: With dead ends: 205 [2022-07-12 19:26:34,038 INFO L226 Difference]: Without dead ends: 201 [2022-07-12 19:26:34,038 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-12 19:26:34,039 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-12 19:26:34,039 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-12 19:26:34,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-12 19:26:34,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-07-12 19:26:34,045 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-12 19:26:34,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 296 transitions. [2022-07-12 19:26:34,046 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 296 transitions. Word has length 15 [2022-07-12 19:26:34,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:34,046 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 296 transitions. [2022-07-12 19:26:34,046 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-12 19:26:34,047 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 296 transitions. [2022-07-12 19:26:34,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 19:26:34,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:34,047 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-12 19:26:34,056 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-12 19:26:34,247 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-12 19:26:34,248 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:34,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:34,248 INFO L85 PathProgramCache]: Analyzing trace with hash 509601447, now seen corresponding path program 1 times [2022-07-12 19:26:34,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:34,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173816653] [2022-07-12 19:26:34,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:34,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:34,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:34,250 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-12 19:26:34,255 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-12 19:26:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:34,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 19:26:34,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:34,400 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-12 19:26:34,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:34,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:34,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173816653] [2022-07-12 19:26:34,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173816653] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:34,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:34,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:26:34,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76342561] [2022-07-12 19:26:34,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:34,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:26:34,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:34,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:26:34,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:26:34,403 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-12 19:26:34,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:34,566 INFO L93 Difference]: Finished difference Result 269 states and 381 transitions. [2022-07-12 19:26:34,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:26:34,566 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-12 19:26:34,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:34,568 INFO L225 Difference]: With dead ends: 269 [2022-07-12 19:26:34,568 INFO L226 Difference]: Without dead ends: 268 [2022-07-12 19:26:34,568 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-12 19:26:34,569 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:34,570 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.1s Time] [2022-07-12 19:26:34,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-12 19:26:34,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 252. [2022-07-12 19:26:34,589 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-12 19:26:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 361 transitions. [2022-07-12 19:26:34,591 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 361 transitions. Word has length 19 [2022-07-12 19:26:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:34,591 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 361 transitions. [2022-07-12 19:26:34,591 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-12 19:26:34,591 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 361 transitions. [2022-07-12 19:26:34,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 19:26:34,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:34,592 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-12 19:26:34,604 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-12 19:26:34,798 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-12 19:26:34,799 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:34,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:34,799 INFO L85 PathProgramCache]: Analyzing trace with hash -2016043468, now seen corresponding path program 1 times [2022-07-12 19:26:34,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:34,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486118179] [2022-07-12 19:26:34,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:34,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:34,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:34,801 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-12 19:26:34,801 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-12 19:26:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:34,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:26:34,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:34,886 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-12 19:26:34,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:34,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:34,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486118179] [2022-07-12 19:26:34,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486118179] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:34,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:34,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:26:34,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856889392] [2022-07-12 19:26:34,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:34,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:34,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:34,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:34,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:34,888 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-12 19:26:34,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:34,908 INFO L93 Difference]: Finished difference Result 312 states and 436 transitions. [2022-07-12 19:26:34,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:34,910 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-12 19:26:34,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:34,912 INFO L225 Difference]: With dead ends: 312 [2022-07-12 19:26:34,913 INFO L226 Difference]: Without dead ends: 312 [2022-07-12 19:26:34,915 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-12 19:26:34,919 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-12 19:26:34,921 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-12 19:26:34,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-12 19:26:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 290. [2022-07-12 19:26:34,943 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-12 19:26:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 410 transitions. [2022-07-12 19:26:34,944 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 410 transitions. Word has length 18 [2022-07-12 19:26:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:34,944 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 410 transitions. [2022-07-12 19:26:34,944 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-12 19:26:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 410 transitions. [2022-07-12 19:26:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 19:26:34,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:34,945 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-12 19:26:34,975 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-12 19:26:35,151 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-12 19:26:35,151 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:35,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:35,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1363549369, now seen corresponding path program 1 times [2022-07-12 19:26:35,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:35,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502896327] [2022-07-12 19:26:35,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:35,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:35,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:35,153 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-12 19:26:35,154 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-12 19:26:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:35,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:26:35,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:35,306 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-12 19:26:35,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:35,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:35,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502896327] [2022-07-12 19:26:35,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502896327] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:35,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:35,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:26:35,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384445513] [2022-07-12 19:26:35,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:35,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:26:35,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:35,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:26:35,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:26:35,307 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-12 19:26:35,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:35,408 INFO L93 Difference]: Finished difference Result 289 states and 407 transitions. [2022-07-12 19:26:35,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:26:35,408 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-12 19:26:35,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:35,410 INFO L225 Difference]: With dead ends: 289 [2022-07-12 19:26:35,410 INFO L226 Difference]: Without dead ends: 289 [2022-07-12 19:26:35,410 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-12 19:26:35,410 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-12 19:26:35,410 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-12 19:26:35,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-12 19:26:35,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2022-07-12 19:26:35,416 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-12 19:26:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 407 transitions. [2022-07-12 19:26:35,418 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 407 transitions. Word has length 29 [2022-07-12 19:26:35,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:35,418 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 407 transitions. [2022-07-12 19:26:35,418 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-12 19:26:35,418 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 407 transitions. [2022-07-12 19:26:35,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 19:26:35,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:35,420 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-12 19:26:35,429 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-12 19:26:35,627 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-12 19:26:35,627 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:35,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:35,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1270637010, now seen corresponding path program 1 times [2022-07-12 19:26:35,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:35,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126506229] [2022-07-12 19:26:35,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:35,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:35,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:35,629 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-12 19:26:35,630 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-12 19:26:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:35,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:26:35,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:35,821 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-12 19:26:35,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:35,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:35,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126506229] [2022-07-12 19:26:35,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126506229] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:35,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:35,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:26:35,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571196896] [2022-07-12 19:26:35,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:35,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:26:35,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:35,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:26:35,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:26:35,825 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-12 19:26:35,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:35,956 INFO L93 Difference]: Finished difference Result 307 states and 427 transitions. [2022-07-12 19:26:35,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:26:35,957 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-12 19:26:35,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:35,958 INFO L225 Difference]: With dead ends: 307 [2022-07-12 19:26:35,958 INFO L226 Difference]: Without dead ends: 306 [2022-07-12 19:26:35,959 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-12 19:26:35,959 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:35,959 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.1s Time] [2022-07-12 19:26:35,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-12 19:26:35,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2022-07-12 19:26:35,965 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-12 19:26:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 422 transitions. [2022-07-12 19:26:35,966 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 422 transitions. Word has length 33 [2022-07-12 19:26:35,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:35,966 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 422 transitions. [2022-07-12 19:26:35,966 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-12 19:26:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 422 transitions. [2022-07-12 19:26:35,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:26:35,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:35,967 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-12 19:26:35,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-12 19:26:36,175 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-12 19:26:36,175 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:36,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:36,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1113906492, now seen corresponding path program 1 times [2022-07-12 19:26:36,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:36,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629570424] [2022-07-12 19:26:36,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:36,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:36,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:36,177 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-12 19:26:36,179 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-12 19:26:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:36,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:26:36,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:36,343 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-12 19:26:36,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:36,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:36,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629570424] [2022-07-12 19:26:36,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629570424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:36,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:36,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:26:36,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425511856] [2022-07-12 19:26:36,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:36,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:26:36,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:36,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:26:36,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:26:36,346 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-12 19:26:36,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:36,498 INFO L93 Difference]: Finished difference Result 306 states and 425 transitions. [2022-07-12 19:26:36,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:26:36,498 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-12 19:26:36,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:36,500 INFO L225 Difference]: With dead ends: 306 [2022-07-12 19:26:36,500 INFO L226 Difference]: Without dead ends: 306 [2022-07-12 19:26:36,500 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-12 19:26:36,501 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-12 19:26:36,501 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-12 19:26:36,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-12 19:26:36,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2022-07-12 19:26:36,507 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-12 19:26:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 421 transitions. [2022-07-12 19:26:36,509 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 421 transitions. Word has length 34 [2022-07-12 19:26:36,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:36,509 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 421 transitions. [2022-07-12 19:26:36,509 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-12 19:26:36,509 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 421 transitions. [2022-07-12 19:26:36,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:26:36,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:36,511 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-12 19:26:36,524 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-12 19:26:36,711 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-12 19:26:36,711 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:36,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:36,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2136327390, now seen corresponding path program 1 times [2022-07-12 19:26:36,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:36,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003470506] [2022-07-12 19:26:36,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:36,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:36,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:36,714 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-12 19:26:36,715 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-12 19:26:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:36,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:26:36,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:36,789 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-12 19:26:36,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:36,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:36,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003470506] [2022-07-12 19:26:36,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003470506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:36,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:36,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:26:36,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705059246] [2022-07-12 19:26:36,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:36,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:36,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:36,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:36,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:36,791 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-12 19:26:36,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:36,801 INFO L93 Difference]: Finished difference Result 282 states and 385 transitions. [2022-07-12 19:26:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:36,802 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-12 19:26:36,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:36,803 INFO L225 Difference]: With dead ends: 282 [2022-07-12 19:26:36,803 INFO L226 Difference]: Without dead ends: 282 [2022-07-12 19:26:36,803 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-12 19:26:36,804 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-12 19:26:36,804 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-12 19:26:36,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-12 19:26:36,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 268. [2022-07-12 19:26:36,808 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-12 19:26:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 370 transitions. [2022-07-12 19:26:36,809 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 370 transitions. Word has length 34 [2022-07-12 19:26:36,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:36,810 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 370 transitions. [2022-07-12 19:26:36,810 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-12 19:26:36,810 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 370 transitions. [2022-07-12 19:26:36,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:26:36,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:36,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:26:36,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-12 19:26:37,017 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-12 19:26:37,018 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:37,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:37,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2069817048, now seen corresponding path program 1 times [2022-07-12 19:26:37,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:37,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077206882] [2022-07-12 19:26:37,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:37,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:37,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:37,019 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-12 19:26:37,020 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-12 19:26:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:37,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:26:37,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:37,182 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-12 19:26:37,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:37,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:37,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077206882] [2022-07-12 19:26:37,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077206882] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:37,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:37,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:26:37,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120649558] [2022-07-12 19:26:37,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:37,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:26:37,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:37,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:26:37,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:26:37,185 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-12 19:26:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:37,281 INFO L93 Difference]: Finished difference Result 268 states and 368 transitions. [2022-07-12 19:26:37,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:26:37,282 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-12 19:26:37,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:37,283 INFO L225 Difference]: With dead ends: 268 [2022-07-12 19:26:37,283 INFO L226 Difference]: Without dead ends: 268 [2022-07-12 19:26:37,283 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-12 19:26:37,284 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-12 19:26:37,284 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-12 19:26:37,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-12 19:26:37,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2022-07-12 19:26:37,288 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-12 19:26:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 368 transitions. [2022-07-12 19:26:37,288 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 368 transitions. Word has length 34 [2022-07-12 19:26:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:37,289 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 368 transitions. [2022-07-12 19:26:37,289 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-12 19:26:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 368 transitions. [2022-07-12 19:26:37,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 19:26:37,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:37,289 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-12 19:26:37,307 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-12 19:26:37,499 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-12 19:26:37,499 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:37,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:37,500 INFO L85 PathProgramCache]: Analyzing trace with hash -382146908, now seen corresponding path program 1 times [2022-07-12 19:26:37,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:37,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177009989] [2022-07-12 19:26:37,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:37,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:37,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:37,501 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-12 19:26:37,503 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-12 19:26:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:37,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:26:37,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:37,594 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-12 19:26:37,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:37,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:37,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177009989] [2022-07-12 19:26:37,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177009989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:37,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:37,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:26:37,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943863759] [2022-07-12 19:26:37,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:37,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:37,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:37,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:37,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:37,605 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-12 19:26:37,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:37,616 INFO L93 Difference]: Finished difference Result 262 states and 356 transitions. [2022-07-12 19:26:37,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:37,617 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-12 19:26:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:37,619 INFO L225 Difference]: With dead ends: 262 [2022-07-12 19:26:37,619 INFO L226 Difference]: Without dead ends: 232 [2022-07-12 19:26:37,619 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-12 19:26:37,619 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-12 19:26:37,620 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-12 19:26:37,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-12 19:26:37,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 210. [2022-07-12 19:26:37,625 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-12 19:26:37,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 287 transitions. [2022-07-12 19:26:37,627 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 287 transitions. Word has length 35 [2022-07-12 19:26:37,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:37,627 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 287 transitions. [2022-07-12 19:26:37,627 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-12 19:26:37,627 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 287 transitions. [2022-07-12 19:26:37,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:26:37,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:37,628 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-12 19:26:37,636 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-12 19:26:37,834 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-12 19:26:37,835 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:37,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:37,835 INFO L85 PathProgramCache]: Analyzing trace with hash 758626562, now seen corresponding path program 1 times [2022-07-12 19:26:37,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:37,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786030604] [2022-07-12 19:26:37,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:37,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:37,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:37,836 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-12 19:26:37,837 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-12 19:26:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:37,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:26:37,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:37,918 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-12 19:26:37,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:37,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:37,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786030604] [2022-07-12 19:26:37,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786030604] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:37,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:37,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:26:37,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704212221] [2022-07-12 19:26:37,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:37,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:37,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:37,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:37,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:37,919 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-12 19:26:37,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:37,954 INFO L93 Difference]: Finished difference Result 208 states and 283 transitions. [2022-07-12 19:26:37,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:37,954 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-12 19:26:37,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:37,955 INFO L225 Difference]: With dead ends: 208 [2022-07-12 19:26:37,955 INFO L226 Difference]: Without dead ends: 208 [2022-07-12 19:26:37,956 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-12 19:26:37,956 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-12 19:26:37,956 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-12 19:26:37,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-12 19:26:37,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-07-12 19:26:37,959 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-12 19:26:37,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 283 transitions. [2022-07-12 19:26:37,960 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 283 transitions. Word has length 39 [2022-07-12 19:26:37,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:37,960 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 283 transitions. [2022-07-12 19:26:37,960 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-12 19:26:37,960 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 283 transitions. [2022-07-12 19:26:37,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:26:37,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:37,961 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-12 19:26:37,967 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-12 19:26:38,167 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-12 19:26:38,168 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:38,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:38,168 INFO L85 PathProgramCache]: Analyzing trace with hash 143802726, now seen corresponding path program 1 times [2022-07-12 19:26:38,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:38,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515159527] [2022-07-12 19:26:38,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:38,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:38,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:38,169 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-12 19:26:38,170 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-12 19:26:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:38,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 19:26:38,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:38,304 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-12 19:26:38,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:38,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:38,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515159527] [2022-07-12 19:26:38,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515159527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:38,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:38,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:26:38,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721667273] [2022-07-12 19:26:38,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:38,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:26:38,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:38,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:26:38,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:26:38,306 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-12 19:26:38,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:38,431 INFO L93 Difference]: Finished difference Result 224 states and 301 transitions. [2022-07-12 19:26:38,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:26:38,432 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-12 19:26:38,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:38,433 INFO L225 Difference]: With dead ends: 224 [2022-07-12 19:26:38,433 INFO L226 Difference]: Without dead ends: 207 [2022-07-12 19:26:38,434 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-12 19:26:38,434 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-12 19:26:38,434 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-12 19:26:38,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-12 19:26:38,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-07-12 19:26:38,437 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-12 19:26:38,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 281 transitions. [2022-07-12 19:26:38,438 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 281 transitions. Word has length 37 [2022-07-12 19:26:38,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:38,438 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 281 transitions. [2022-07-12 19:26:38,438 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-12 19:26:38,438 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 281 transitions. [2022-07-12 19:26:38,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 19:26:38,441 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:38,441 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-12 19:26:38,455 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-12 19:26:38,647 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-12 19:26:38,648 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:38,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:38,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1174329751, now seen corresponding path program 1 times [2022-07-12 19:26:38,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:38,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970181560] [2022-07-12 19:26:38,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:38,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:38,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:38,649 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-12 19:26:38,650 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-12 19:26:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:38,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 19:26:38,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:38,753 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-12 19:26:38,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:38,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:38,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970181560] [2022-07-12 19:26:38,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970181560] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:38,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:38,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:26:38,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839838862] [2022-07-12 19:26:38,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:38,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:26:38,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:38,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:26:38,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:26:38,755 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-12 19:26:38,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:38,850 INFO L93 Difference]: Finished difference Result 223 states and 299 transitions. [2022-07-12 19:26:38,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:26:38,850 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-12 19:26:38,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:38,851 INFO L225 Difference]: With dead ends: 223 [2022-07-12 19:26:38,851 INFO L226 Difference]: Without dead ends: 206 [2022-07-12 19:26:38,851 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-12 19:26:38,851 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 51 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:38,852 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.0s Time] [2022-07-12 19:26:38,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-12 19:26:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-07-12 19:26:38,855 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-12 19:26:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 279 transitions. [2022-07-12 19:26:38,855 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 279 transitions. Word has length 38 [2022-07-12 19:26:38,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:38,855 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 279 transitions. [2022-07-12 19:26:38,855 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-12 19:26:38,856 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 279 transitions. [2022-07-12 19:26:38,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 19:26:38,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:38,856 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-12 19:26:38,864 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-12 19:26:39,056 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-12 19:26:39,057 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:39,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:39,057 INFO L85 PathProgramCache]: Analyzing trace with hash -461855063, now seen corresponding path program 1 times [2022-07-12 19:26:39,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:39,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124839391] [2022-07-12 19:26:39,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:39,058 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:39,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:39,059 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-12 19:26:39,059 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-12 19:26:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:39,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 19:26:39,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:39,176 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-12 19:26:39,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:39,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:39,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124839391] [2022-07-12 19:26:39,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124839391] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:39,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:39,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:26:39,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590080018] [2022-07-12 19:26:39,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:39,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:26:39,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:39,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:26:39,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:26:39,178 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-12 19:26:39,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:39,257 INFO L93 Difference]: Finished difference Result 215 states and 288 transitions. [2022-07-12 19:26:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:26:39,257 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-12 19:26:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:39,258 INFO L225 Difference]: With dead ends: 215 [2022-07-12 19:26:39,258 INFO L226 Difference]: Without dead ends: 186 [2022-07-12 19:26:39,259 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-12 19:26:39,259 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-12 19:26:39,259 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-12 19:26:39,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-12 19:26:39,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-07-12 19:26:39,262 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-12 19:26:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 251 transitions. [2022-07-12 19:26:39,262 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 251 transitions. Word has length 38 [2022-07-12 19:26:39,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:39,262 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 251 transitions. [2022-07-12 19:26:39,263 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-12 19:26:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 251 transitions. [2022-07-12 19:26:39,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 19:26:39,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:39,264 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-12 19:26:39,271 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-12 19:26:39,470 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-12 19:26:39,470 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:39,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:39,471 INFO L85 PathProgramCache]: Analyzing trace with hash -233541237, now seen corresponding path program 1 times [2022-07-12 19:26:39,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:39,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599283092] [2022-07-12 19:26:39,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:39,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:39,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:39,472 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-12 19:26:39,474 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-12 19:26:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:39,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:26:39,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:39,566 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-12 19:26:39,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:39,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:39,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599283092] [2022-07-12 19:26:39,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599283092] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:39,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:39,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:26:39,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90347293] [2022-07-12 19:26:39,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:39,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:26:39,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:39,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:26:39,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:26:39,568 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-12 19:26:39,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:39,577 INFO L93 Difference]: Finished difference Result 179 states and 241 transitions. [2022-07-12 19:26:39,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:26:39,577 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-12 19:26:39,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:39,578 INFO L225 Difference]: With dead ends: 179 [2022-07-12 19:26:39,578 INFO L226 Difference]: Without dead ends: 179 [2022-07-12 19:26:39,578 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-12 19:26:39,579 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-12 19:26:39,579 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-12 19:26:39,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-12 19:26:39,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2022-07-12 19:26:39,582 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-12 19:26:39,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 241 transitions. [2022-07-12 19:26:39,583 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 241 transitions. Word has length 41 [2022-07-12 19:26:39,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:39,583 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 241 transitions. [2022-07-12 19:26:39,583 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-12 19:26:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 241 transitions. [2022-07-12 19:26:39,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:26:39,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:39,584 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-12 19:26:39,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-12 19:26:39,791 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-12 19:26:39,791 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:39,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:39,792 INFO L85 PathProgramCache]: Analyzing trace with hash 348485743, now seen corresponding path program 1 times [2022-07-12 19:26:39,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:39,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248332892] [2022-07-12 19:26:39,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:39,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:39,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:39,793 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-12 19:26:39,795 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-12 19:26:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:39,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:26:39,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:39,944 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-12 19:26:39,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:39,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:39,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248332892] [2022-07-12 19:26:39,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248332892] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:39,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:39,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:26:39,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206625151] [2022-07-12 19:26:39,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:39,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:26:39,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:39,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:26:39,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:26:39,946 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-12 19:26:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:40,079 INFO L93 Difference]: Finished difference Result 178 states and 238 transitions. [2022-07-12 19:26:40,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:26:40,080 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-12 19:26:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:40,080 INFO L225 Difference]: With dead ends: 178 [2022-07-12 19:26:40,080 INFO L226 Difference]: Without dead ends: 178 [2022-07-12 19:26:40,081 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-12 19:26:40,081 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-12 19:26:40,081 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-12 19:26:40,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-12 19:26:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-07-12 19:26:40,084 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-12 19:26:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 238 transitions. [2022-07-12 19:26:40,085 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 238 transitions. Word has length 42 [2022-07-12 19:26:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:40,086 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 238 transitions. [2022-07-12 19:26:40,086 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-12 19:26:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 238 transitions. [2022-07-12 19:26:40,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:26:40,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:40,086 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-12 19:26:40,097 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-12 19:26:40,293 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-12 19:26:40,294 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:40,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:40,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1096582801, now seen corresponding path program 1 times [2022-07-12 19:26:40,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:40,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037400321] [2022-07-12 19:26:40,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:40,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:40,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:40,295 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-12 19:26:40,296 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-12 19:26:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:40,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 19:26:40,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:40,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-12 19:26:40,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:40,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:40,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037400321] [2022-07-12 19:26:40,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037400321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:40,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:40,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:26:40,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643682170] [2022-07-12 19:26:40,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:40,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:26:40,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:40,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:26:40,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:26:40,441 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-12 19:26:40,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:40,598 INFO L93 Difference]: Finished difference Result 231 states and 302 transitions. [2022-07-12 19:26:40,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:26:40,599 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-12 19:26:40,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:40,600 INFO L225 Difference]: With dead ends: 231 [2022-07-12 19:26:40,600 INFO L226 Difference]: Without dead ends: 218 [2022-07-12 19:26:40,600 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-12 19:26:40,600 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:40,601 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.1s Time] [2022-07-12 19:26:40,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-12 19:26:40,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 187. [2022-07-12 19:26:40,604 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-12 19:26:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 249 transitions. [2022-07-12 19:26:40,605 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 249 transitions. Word has length 42 [2022-07-12 19:26:40,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:40,605 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 249 transitions. [2022-07-12 19:26:40,605 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-12 19:26:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 249 transitions. [2022-07-12 19:26:40,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 19:26:40,606 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:40,606 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-12 19:26:40,631 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-12 19:26:40,813 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-12 19:26:40,814 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:40,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:40,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1105542194, now seen corresponding path program 1 times [2022-07-12 19:26:40,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:40,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293544755] [2022-07-12 19:26:40,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:40,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:40,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:40,819 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-12 19:26:40,822 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-12 19:26:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:40,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:26:40,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:40,900 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-12 19:26:40,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:40,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:40,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293544755] [2022-07-12 19:26:40,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293544755] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:40,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:40,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:26:40,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458012869] [2022-07-12 19:26:40,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:40,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:40,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:40,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:40,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:40,903 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-12 19:26:40,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:40,911 INFO L93 Difference]: Finished difference Result 188 states and 249 transitions. [2022-07-12 19:26:40,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:40,912 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-12 19:26:40,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:40,913 INFO L225 Difference]: With dead ends: 188 [2022-07-12 19:26:40,913 INFO L226 Difference]: Without dead ends: 187 [2022-07-12 19:26:40,913 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-12 19:26:40,913 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-12 19:26:40,914 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-12 19:26:40,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-12 19:26:40,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-12 19:26:40,919 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-12 19:26:40,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 248 transitions. [2022-07-12 19:26:40,920 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 248 transitions. Word has length 48 [2022-07-12 19:26:40,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:40,921 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 248 transitions. [2022-07-12 19:26:40,921 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-12 19:26:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 248 transitions. [2022-07-12 19:26:40,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 19:26:40,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:40,922 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-12 19:26:40,931 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-12 19:26:41,129 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-12 19:26:41,129 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:41,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:41,130 INFO L85 PathProgramCache]: Analyzing trace with hash 437296472, now seen corresponding path program 1 times [2022-07-12 19:26:41,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:41,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717741161] [2022-07-12 19:26:41,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:41,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:41,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:41,131 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-12 19:26:41,133 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-12 19:26:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:41,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:26:41,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:41,210 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-12 19:26:41,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:41,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:41,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717741161] [2022-07-12 19:26:41,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717741161] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:41,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:41,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:26:41,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199806544] [2022-07-12 19:26:41,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:41,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:41,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:41,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:41,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:41,213 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-12 19:26:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:41,220 INFO L93 Difference]: Finished difference Result 188 states and 248 transitions. [2022-07-12 19:26:41,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:41,220 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-12 19:26:41,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:41,221 INFO L225 Difference]: With dead ends: 188 [2022-07-12 19:26:41,221 INFO L226 Difference]: Without dead ends: 187 [2022-07-12 19:26:41,221 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-12 19:26:41,222 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-12 19:26:41,222 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-12 19:26:41,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-12 19:26:41,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-12 19:26:41,225 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-12 19:26:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 246 transitions. [2022-07-12 19:26:41,225 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 246 transitions. Word has length 49 [2022-07-12 19:26:41,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:41,226 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 246 transitions. [2022-07-12 19:26:41,226 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-12 19:26:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 246 transitions. [2022-07-12 19:26:41,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 19:26:41,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:41,227 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-12 19:26:41,233 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-12 19:26:41,433 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-12 19:26:41,434 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:41,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:41,434 INFO L85 PathProgramCache]: Analyzing trace with hash 364909914, now seen corresponding path program 1 times [2022-07-12 19:26:41,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:41,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305491452] [2022-07-12 19:26:41,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:41,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:41,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:41,436 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-12 19:26:41,441 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-12 19:26:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:41,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 19:26:41,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:41,601 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-12 19:26:41,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:41,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:41,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305491452] [2022-07-12 19:26:41,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305491452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:41,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:41,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 19:26:41,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648270975] [2022-07-12 19:26:41,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:41,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:26:41,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:41,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:26:41,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:26:41,603 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-12 19:26:41,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:41,769 INFO L93 Difference]: Finished difference Result 232 states and 299 transitions. [2022-07-12 19:26:41,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:26:41,770 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-12 19:26:41,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:41,771 INFO L225 Difference]: With dead ends: 232 [2022-07-12 19:26:41,771 INFO L226 Difference]: Without dead ends: 221 [2022-07-12 19:26:41,771 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-12 19:26:41,771 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:41,772 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.1s Time] [2022-07-12 19:26:41,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-12 19:26:41,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 190. [2022-07-12 19:26:41,775 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-12 19:26:41,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 249 transitions. [2022-07-12 19:26:41,775 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 249 transitions. Word has length 49 [2022-07-12 19:26:41,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:41,775 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 249 transitions. [2022-07-12 19:26:41,775 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-12 19:26:41,775 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 249 transitions. [2022-07-12 19:26:41,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 19:26:41,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:41,776 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-12 19:26:41,785 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-12 19:26:41,976 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-12 19:26:41,977 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:41,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:41,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1169166180, now seen corresponding path program 1 times [2022-07-12 19:26:41,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:41,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254053893] [2022-07-12 19:26:41,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:41,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:41,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:41,978 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-12 19:26:41,979 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-12 19:26:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:42,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:26:42,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:42,141 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-12 19:26:42,141 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:42,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:42,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254053893] [2022-07-12 19:26:42,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254053893] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:42,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:42,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:26:42,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946549155] [2022-07-12 19:26:42,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:42,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:26:42,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:42,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:26:42,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:26:42,143 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-12 19:26:42,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:42,210 INFO L93 Difference]: Finished difference Result 190 states and 247 transitions. [2022-07-12 19:26:42,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:26:42,211 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-12 19:26:42,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:42,211 INFO L225 Difference]: With dead ends: 190 [2022-07-12 19:26:42,211 INFO L226 Difference]: Without dead ends: 190 [2022-07-12 19:26:42,211 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-12 19:26:42,212 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-12 19:26:42,218 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-12 19:26:42,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-12 19:26:42,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-07-12 19:26:42,221 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-12 19:26:42,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2022-07-12 19:26:42,222 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 45 [2022-07-12 19:26:42,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:42,222 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2022-07-12 19:26:42,222 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-12 19:26:42,222 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2022-07-12 19:26:42,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 19:26:42,223 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:42,223 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-12 19:26:42,245 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-12 19:26:42,433 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-12 19:26:42,433 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:42,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:42,433 INFO L85 PathProgramCache]: Analyzing trace with hash -648920610, now seen corresponding path program 1 times [2022-07-12 19:26:42,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:42,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682600849] [2022-07-12 19:26:42,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:42,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:42,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:42,435 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-12 19:26:42,435 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-12 19:26:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:42,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 19:26:42,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:42,572 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-12 19:26:42,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:42,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:42,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682600849] [2022-07-12 19:26:42,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682600849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:42,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:42,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:26:42,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527822819] [2022-07-12 19:26:42,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:42,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:26:42,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:42,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:26:42,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:26:42,574 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-12 19:26:42,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:42,683 INFO L93 Difference]: Finished difference Result 214 states and 274 transitions. [2022-07-12 19:26:42,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:26:42,684 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-12 19:26:42,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:42,686 INFO L225 Difference]: With dead ends: 214 [2022-07-12 19:26:42,686 INFO L226 Difference]: Without dead ends: 202 [2022-07-12 19:26:42,686 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-12 19:26:42,686 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-12 19:26:42,686 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-12 19:26:42,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-12 19:26:42,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 196. [2022-07-12 19:26:42,690 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-12 19:26:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 255 transitions. [2022-07-12 19:26:42,691 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 255 transitions. Word has length 43 [2022-07-12 19:26:42,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:42,693 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 255 transitions. [2022-07-12 19:26:42,693 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-12 19:26:42,693 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 255 transitions. [2022-07-12 19:26:42,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 19:26:42,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:42,694 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-12 19:26:42,717 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-12 19:26:42,900 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-12 19:26:42,901 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:42,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:42,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1043867234, now seen corresponding path program 1 times [2022-07-12 19:26:42,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:42,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72394413] [2022-07-12 19:26:42,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:42,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:42,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:42,903 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-12 19:26:42,904 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-12 19:26:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:42,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 19:26:42,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:43,053 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-12 19:26:43,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:43,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:43,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72394413] [2022-07-12 19:26:43,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72394413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:43,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:43,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:26:43,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039815311] [2022-07-12 19:26:43,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:43,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:26:43,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:43,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:26:43,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:26:43,055 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-12 19:26:43,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:43,155 INFO L93 Difference]: Finished difference Result 207 states and 265 transitions. [2022-07-12 19:26:43,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:26:43,156 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-12 19:26:43,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:43,156 INFO L225 Difference]: With dead ends: 207 [2022-07-12 19:26:43,157 INFO L226 Difference]: Without dead ends: 191 [2022-07-12 19:26:43,157 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-12 19:26:43,157 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-12 19:26:43,157 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-12 19:26:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-12 19:26:43,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2022-07-12 19:26:43,160 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-12 19:26:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 239 transitions. [2022-07-12 19:26:43,160 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 239 transitions. Word has length 43 [2022-07-12 19:26:43,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:43,160 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 239 transitions. [2022-07-12 19:26:43,161 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-12 19:26:43,161 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 239 transitions. [2022-07-12 19:26:43,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 19:26:43,161 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:43,161 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-12 19:26:43,171 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-12 19:26:43,361 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-12 19:26:43,362 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:43,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:43,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1608018874, now seen corresponding path program 1 times [2022-07-12 19:26:43,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:43,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780689442] [2022-07-12 19:26:43,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:43,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:43,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:43,363 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-12 19:26:43,364 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-12 19:26:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:43,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 19:26:43,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:43,514 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-12 19:26:43,514 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:43,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:43,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780689442] [2022-07-12 19:26:43,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780689442] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:43,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:43,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:26:43,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99221256] [2022-07-12 19:26:43,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:43,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:26:43,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:43,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:26:43,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:26:43,515 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-12 19:26:43,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:43,672 INFO L93 Difference]: Finished difference Result 210 states and 265 transitions. [2022-07-12 19:26:43,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:26:43,673 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-12 19:26:43,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:43,674 INFO L225 Difference]: With dead ends: 210 [2022-07-12 19:26:43,674 INFO L226 Difference]: Without dead ends: 198 [2022-07-12 19:26:43,674 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-12 19:26:43,674 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-12 19:26:43,674 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-12 19:26:43,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-12 19:26:43,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 185. [2022-07-12 19:26:43,678 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-12 19:26:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 238 transitions. [2022-07-12 19:26:43,679 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 238 transitions. Word has length 43 [2022-07-12 19:26:43,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:43,679 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 238 transitions. [2022-07-12 19:26:43,679 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-12 19:26:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 238 transitions. [2022-07-12 19:26:43,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 19:26:43,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:43,680 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-12 19:26:43,687 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-12 19:26:43,887 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-12 19:26:43,887 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:43,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:43,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1614034079, now seen corresponding path program 1 times [2022-07-12 19:26:43,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:43,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775121448] [2022-07-12 19:26:43,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:43,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:43,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:43,889 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-12 19:26:43,890 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-12 19:26:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:43,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 19:26:43,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:44,045 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-12 19:26:44,045 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:44,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:44,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775121448] [2022-07-12 19:26:44,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775121448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:44,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:44,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 19:26:44,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617408361] [2022-07-12 19:26:44,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:44,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:26:44,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:44,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:26:44,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:26:44,047 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-12 19:26:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:44,152 INFO L93 Difference]: Finished difference Result 211 states and 267 transitions. [2022-07-12 19:26:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:26:44,152 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-12 19:26:44,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:44,153 INFO L225 Difference]: With dead ends: 211 [2022-07-12 19:26:44,153 INFO L226 Difference]: Without dead ends: 200 [2022-07-12 19:26:44,153 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-12 19:26:44,153 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-12 19:26:44,154 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-12 19:26:44,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-12 19:26:44,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 191. [2022-07-12 19:26:44,156 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-12 19:26:44,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 246 transitions. [2022-07-12 19:26:44,157 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 246 transitions. Word has length 50 [2022-07-12 19:26:44,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:44,157 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 246 transitions. [2022-07-12 19:26:44,157 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-12 19:26:44,157 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 246 transitions. [2022-07-12 19:26:44,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 19:26:44,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:44,158 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-12 19:26:44,166 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-12 19:26:44,358 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-12 19:26:44,358 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:44,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:44,359 INFO L85 PathProgramCache]: Analyzing trace with hash 27450463, now seen corresponding path program 1 times [2022-07-12 19:26:44,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:44,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499601430] [2022-07-12 19:26:44,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:44,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:44,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:44,360 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-12 19:26:44,361 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-12 19:26:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:44,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 19:26:44,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:44,526 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-12 19:26:44,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:44,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:44,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499601430] [2022-07-12 19:26:44,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499601430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:44,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:44,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 19:26:44,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488340675] [2022-07-12 19:26:44,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:44,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:26:44,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:44,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:26:44,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:26:44,529 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-12 19:26:44,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:44,637 INFO L93 Difference]: Finished difference Result 200 states and 255 transitions. [2022-07-12 19:26:44,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:26:44,637 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-12 19:26:44,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:44,638 INFO L225 Difference]: With dead ends: 200 [2022-07-12 19:26:44,638 INFO L226 Difference]: Without dead ends: 167 [2022-07-12 19:26:44,638 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-12 19:26:44,639 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-12 19:26:44,639 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-12 19:26:44,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-12 19:26:44,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2022-07-12 19:26:44,641 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-12 19:26:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 198 transitions. [2022-07-12 19:26:44,642 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 198 transitions. Word has length 50 [2022-07-12 19:26:44,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:44,642 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 198 transitions. [2022-07-12 19:26:44,642 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-12 19:26:44,642 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 198 transitions. [2022-07-12 19:26:44,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:26:44,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:44,642 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-12 19:26:44,651 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-12 19:26:44,843 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-12 19:26:44,843 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:44,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:44,843 INFO L85 PathProgramCache]: Analyzing trace with hash -825515977, now seen corresponding path program 1 times [2022-07-12 19:26:44,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:44,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856982020] [2022-07-12 19:26:44,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:44,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:44,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:44,845 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-12 19:26:44,845 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-12 19:26:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 19:26:44,901 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 19:26:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 19:26:44,992 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-12 19:26:44,992 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 19:26:44,993 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-07-12 19:26:44,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-07-12 19:26:45,021 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-12 19:26:45,203 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-12 19:26:45,205 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-12 19:26:45,208 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 19:26:45,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 07:26:45 BoogieIcfgContainer [2022-07-12 19:26:45,289 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 19:26:45,290 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 19:26:45,290 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 19:26:45,290 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 19:26:45,290 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:26:33" (3/4) ... [2022-07-12 19:26:45,292 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 19:26:45,292 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 19:26:45,293 INFO L158 Benchmark]: Toolchain (without parser) took 13127.95ms. Allocated memory was 48.2MB in the beginning and 104.9MB in the end (delta: 56.6MB). Free memory was 23.4MB in the beginning and 74.0MB in the end (delta: -50.6MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2022-07-12 19:26:45,293 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 48.2MB. Free memory was 30.7MB in the beginning and 30.6MB in the end (delta: 30.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:26:45,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.75ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 23.2MB in the beginning and 34.2MB in the end (delta: -11.0MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2022-07-12 19:26:45,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.43ms. Allocated memory is still 58.7MB. Free memory was 34.2MB in the beginning and 30.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:26:45,294 INFO L158 Benchmark]: Boogie Preprocessor took 51.83ms. Allocated memory is still 58.7MB. Free memory was 30.8MB in the beginning and 40.7MB in the end (delta: -9.9MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2022-07-12 19:26:45,295 INFO L158 Benchmark]: RCFGBuilder took 668.50ms. Allocated memory is still 58.7MB. Free memory was 40.7MB in the beginning and 25.7MB in the end (delta: 15.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-12 19:26:45,296 INFO L158 Benchmark]: TraceAbstraction took 11991.99ms. Allocated memory was 58.7MB in the beginning and 104.9MB in the end (delta: 46.1MB). Free memory was 25.1MB in the beginning and 74.0MB in the end (delta: -48.9MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2022-07-12 19:26:45,296 INFO L158 Benchmark]: Witness Printer took 2.50ms. Allocated memory is still 104.9MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:26:45,297 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.16ms. Allocated memory is still 48.2MB. Free memory was 30.7MB in the beginning and 30.6MB in the end (delta: 30.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.75ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 23.2MB in the beginning and 34.2MB in the end (delta: -11.0MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.43ms. Allocated memory is still 58.7MB. Free memory was 34.2MB in the beginning and 30.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.83ms. Allocated memory is still 58.7MB. Free memory was 30.8MB in the beginning and 40.7MB in the end (delta: -9.9MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * RCFGBuilder took 668.50ms. Allocated memory is still 58.7MB. Free memory was 40.7MB in the beginning and 25.7MB in the end (delta: 15.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11991.99ms. Allocated memory was 58.7MB in the beginning and 104.9MB in the end (delta: 46.1MB). Free memory was 25.1MB in the beginning and 74.0MB in the end (delta: -48.9MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. * Witness Printer took 2.50ms. Allocated memory is still 104.9MB. Free memory is still 74.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: 11.9s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3760 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3736 mSDsluCounter, 21794 SdHoareTripleChecker+Invalid, 1.4s 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, 0.8s 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.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 191 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s 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-12 19:26:45,326 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