./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 f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-f4b24e3 [2022-07-14 07:05:43,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 07:05:43,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 07:05:43,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 07:05:43,109 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 07:05:43,110 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 07:05:43,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 07:05:43,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 07:05:43,114 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 07:05:43,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 07:05:43,115 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 07:05:43,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 07:05:43,116 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 07:05:43,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 07:05:43,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 07:05:43,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 07:05:43,120 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 07:05:43,121 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 07:05:43,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 07:05:43,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 07:05:43,125 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 07:05:43,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 07:05:43,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 07:05:43,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 07:05:43,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 07:05:43,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 07:05:43,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 07:05:43,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 07:05:43,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 07:05:43,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 07:05:43,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 07:05:43,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 07:05:43,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 07:05:43,135 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 07:05:43,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 07:05:43,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 07:05:43,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 07:05:43,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 07:05:43,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 07:05:43,138 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 07:05:43,139 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 07:05:43,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 07:05:43,140 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 07:05:43,158 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 07:05:43,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 07:05:43,159 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 07:05:43,159 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 07:05:43,159 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 07:05:43,160 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 07:05:43,160 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 07:05:43,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 07:05:43,161 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 07:05:43,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 07:05:43,161 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 07:05:43,161 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 07:05:43,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 07:05:43,162 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 07:05:43,162 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 07:05:43,162 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 07:05:43,162 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 07:05:43,162 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 07:05:43,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 07:05:43,163 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 07:05:43,163 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 07:05:43,163 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 07:05:43,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 07:05:43,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 07:05:43,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 07:05:43,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 07:05:43,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 07:05:43,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 07:05:43,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 07:05:43,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 07:05:43,165 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-14 07:05:43,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 07:05:43,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 07:05:43,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 07:05:43,399 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 07:05:43,399 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 07:05:43,401 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-14 07:05:43,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b67b3f8e/db19e05753a947a6bf259390361cfbd7/FLAG0b77378f0 [2022-07-14 07:05:43,886 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 07:05:43,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2022-07-14 07:05:43,903 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b67b3f8e/db19e05753a947a6bf259390361cfbd7/FLAG0b77378f0 [2022-07-14 07:05:44,241 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b67b3f8e/db19e05753a947a6bf259390361cfbd7 [2022-07-14 07:05:44,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 07:05:44,245 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 07:05:44,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 07:05:44,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 07:05:44,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 07:05:44,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 07:05:44" (1/1) ... [2022-07-14 07:05:44,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@200df6ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:44, skipping insertion in model container [2022-07-14 07:05:44,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 07:05:44" (1/1) ... [2022-07-14 07:05:44,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 07:05:44,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 07:05:44,604 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-14 07:05:44,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 07:05:44,616 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 07:05:44,680 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-14 07:05:44,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 07:05:44,701 INFO L208 MainTranslator]: Completed translation [2022-07-14 07:05:44,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:44 WrapperNode [2022-07-14 07:05:44,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 07:05:44,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 07:05:44,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 07:05:44,705 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 07:05:44,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:44" (1/1) ... [2022-07-14 07:05:44,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:44" (1/1) ... [2022-07-14 07:05:44,781 INFO L137 Inliner]: procedures = 29, calls = 44, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 663 [2022-07-14 07:05:44,789 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 07:05:44,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 07:05:44,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 07:05:44,790 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 07:05:44,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:44" (1/1) ... [2022-07-14 07:05:44,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:44" (1/1) ... [2022-07-14 07:05:44,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:44" (1/1) ... [2022-07-14 07:05:44,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:44" (1/1) ... [2022-07-14 07:05:44,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:44" (1/1) ... [2022-07-14 07:05:44,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:44" (1/1) ... [2022-07-14 07:05:44,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:44" (1/1) ... [2022-07-14 07:05:44,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 07:05:44,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 07:05:44,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 07:05:44,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 07:05:44,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:44" (1/1) ... [2022-07-14 07:05:44,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 07:05:44,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:05:44,901 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 07:05:44,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 07:05:44,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 07:05:44,944 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-07-14 07:05:44,945 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-07-14 07:05:44,945 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-14 07:05:44,945 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-14 07:05:44,945 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-07-14 07:05:44,945 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-07-14 07:05:44,945 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-14 07:05:44,945 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-14 07:05:44,946 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-14 07:05:44,946 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-14 07:05:44,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 07:05:44,946 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-14 07:05:44,946 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-14 07:05:44,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 07:05:44,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 07:05:44,947 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-07-14 07:05:44,947 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-07-14 07:05:45,094 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 07:05:45,113 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 07:05:45,251 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 07:05:45,256 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 07:05:45,262 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 07:05:45,267 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 07:05:45,269 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 07:05:45,574 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume !false; [2022-07-14 07:05:45,574 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume false; [2022-07-14 07:05:45,574 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##63: assume !false; [2022-07-14 07:05:45,574 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume false; [2022-07-14 07:05:45,575 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume false; [2022-07-14 07:05:45,575 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !false; [2022-07-14 07:05:45,575 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-07-14 07:05:45,575 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-07-14 07:05:45,575 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume !false; [2022-07-14 07:05:45,575 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume false; [2022-07-14 07:05:45,585 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 07:05:45,611 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-07-14 07:05:45,612 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-07-14 07:05:45,619 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 07:05:45,627 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 07:05:45,627 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 07:05:45,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:05:45 BoogieIcfgContainer [2022-07-14 07:05:45,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 07:05:45,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 07:05:45,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 07:05:45,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 07:05:45,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 07:05:44" (1/3) ... [2022-07-14 07:05:45,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e374ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 07:05:45, skipping insertion in model container [2022-07-14 07:05:45,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:44" (2/3) ... [2022-07-14 07:05:45,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e374ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 07:05:45, skipping insertion in model container [2022-07-14 07:05:45,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:05:45" (3/3) ... [2022-07-14 07:05:45,637 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2022-07-14 07:05:45,657 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 07:05:45,657 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-14 07:05:45,697 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 07:05:45,702 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@162383eb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@31fab7b9 [2022-07-14 07:05:45,702 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-14 07:05:45,707 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-14 07:05:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 07:05:45,712 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:45,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:45,713 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:45,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:45,718 INFO L85 PathProgramCache]: Analyzing trace with hash -15799092, now seen corresponding path program 1 times [2022-07-14 07:05:45,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:45,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769861732] [2022-07-14 07:05:45,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:45,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:45,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:45,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769861732] [2022-07-14 07:05:45,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769861732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:45,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:45,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:05:45,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869951394] [2022-07-14 07:05:45,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:45,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:05:45,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:45,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:05:45,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:05:45,957 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-14 07:05:46,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:46,058 INFO L93 Difference]: Finished difference Result 212 states and 315 transitions. [2022-07-14 07:05:46,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:05:46,061 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-14 07:05:46,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:46,076 INFO L225 Difference]: With dead ends: 212 [2022-07-14 07:05:46,076 INFO L226 Difference]: Without dead ends: 208 [2022-07-14 07:05:46,077 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-14 07:05:46,081 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-14 07:05:46,082 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-14 07:05:46,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-14 07:05:46,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2022-07-14 07:05:46,139 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-14 07:05:46,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 310 transitions. [2022-07-14 07:05:46,150 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 310 transitions. Word has length 8 [2022-07-14 07:05:46,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:46,150 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 310 transitions. [2022-07-14 07:05:46,151 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-14 07:05:46,152 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 310 transitions. [2022-07-14 07:05:46,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 07:05:46,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:46,153 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:46,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 07:05:46,154 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:46,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:46,155 INFO L85 PathProgramCache]: Analyzing trace with hash -191249986, now seen corresponding path program 1 times [2022-07-14 07:05:46,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:46,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946374149] [2022-07-14 07:05:46,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:46,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:46,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:46,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946374149] [2022-07-14 07:05:46,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946374149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:46,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:46,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:05:46,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366798602] [2022-07-14 07:05:46,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:46,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:05:46,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:46,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:05:46,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:05:46,262 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-14 07:05:46,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:46,313 INFO L93 Difference]: Finished difference Result 205 states and 309 transitions. [2022-07-14 07:05:46,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:05:46,314 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-14 07:05:46,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:46,315 INFO L225 Difference]: With dead ends: 205 [2022-07-14 07:05:46,315 INFO L226 Difference]: Without dead ends: 201 [2022-07-14 07:05:46,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:05:46,317 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-14 07:05:46,318 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-14 07:05:46,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-14 07:05:46,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-07-14 07:05:46,326 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-14 07:05:46,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 296 transitions. [2022-07-14 07:05:46,328 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 296 transitions. Word has length 15 [2022-07-14 07:05:46,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:46,329 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 296 transitions. [2022-07-14 07:05:46,329 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-14 07:05:46,329 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 296 transitions. [2022-07-14 07:05:46,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 07:05:46,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:46,330 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-14 07:05:46,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 07:05:46,331 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:46,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:46,331 INFO L85 PathProgramCache]: Analyzing trace with hash 509601447, now seen corresponding path program 1 times [2022-07-14 07:05:46,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:46,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123507504] [2022-07-14 07:05:46,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:46,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,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-14 07:05:46,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:46,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123507504] [2022-07-14 07:05:46,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123507504] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:46,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:46,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:05:46,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201102102] [2022-07-14 07:05:46,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:46,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:05:46,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:46,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:05:46,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:05:46,390 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-14 07:05:46,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:46,478 INFO L93 Difference]: Finished difference Result 269 states and 381 transitions. [2022-07-14 07:05:46,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:05:46,478 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-14 07:05:46,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:46,480 INFO L225 Difference]: With dead ends: 269 [2022-07-14 07:05:46,480 INFO L226 Difference]: Without dead ends: 268 [2022-07-14 07:05:46,481 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-14 07:05:46,482 INFO L413 NwaCegarLoop]: 331 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, 440 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-14 07:05:46,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 440 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:05:46,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-14 07:05:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 252. [2022-07-14 07:05:46,495 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-14 07:05:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 361 transitions. [2022-07-14 07:05:46,497 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 361 transitions. Word has length 19 [2022-07-14 07:05:46,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:46,497 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 361 transitions. [2022-07-14 07:05:46,498 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-14 07:05:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 361 transitions. [2022-07-14 07:05:46,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 07:05:46,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:46,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:46,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 07:05:46,499 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:46,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:46,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2016043468, now seen corresponding path program 1 times [2022-07-14 07:05:46,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:46,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887363337] [2022-07-14 07:05:46,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:46,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:46,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:46,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887363337] [2022-07-14 07:05:46,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887363337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:46,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:46,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:05:46,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379147355] [2022-07-14 07:05:46,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:46,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:05:46,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:46,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:05:46,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:05:46,546 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-14 07:05:46,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:46,565 INFO L93 Difference]: Finished difference Result 312 states and 436 transitions. [2022-07-14 07:05:46,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:05:46,565 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-14 07:05:46,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:46,568 INFO L225 Difference]: With dead ends: 312 [2022-07-14 07:05:46,568 INFO L226 Difference]: Without dead ends: 312 [2022-07-14 07:05:46,568 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-14 07:05:46,577 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-14 07:05:46,579 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-14 07:05:46,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-14 07:05:46,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 290. [2022-07-14 07:05:46,595 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-14 07:05:46,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 410 transitions. [2022-07-14 07:05:46,596 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 410 transitions. Word has length 18 [2022-07-14 07:05:46,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:46,597 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 410 transitions. [2022-07-14 07:05:46,597 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-14 07:05:46,597 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 410 transitions. [2022-07-14 07:05:46,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 07:05:46,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:46,603 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-14 07:05:46,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 07:05:46,604 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:46,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:46,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1363549369, now seen corresponding path program 1 times [2022-07-14 07:05:46,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:46,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430935164] [2022-07-14 07:05:46,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:46,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:46,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:46,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430935164] [2022-07-14 07:05:46,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430935164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:46,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:46,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:05:46,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480990309] [2022-07-14 07:05:46,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:46,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:05:46,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:46,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:05:46,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:05:46,695 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-14 07:05:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:46,745 INFO L93 Difference]: Finished difference Result 289 states and 407 transitions. [2022-07-14 07:05:46,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:05:46,746 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-14 07:05:46,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:46,748 INFO L225 Difference]: With dead ends: 289 [2022-07-14 07:05:46,748 INFO L226 Difference]: Without dead ends: 289 [2022-07-14 07:05:46,748 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-14 07:05:46,749 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-14 07:05:46,749 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-14 07:05:46,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-14 07:05:46,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2022-07-14 07:05:46,756 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-14 07:05:46,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 407 transitions. [2022-07-14 07:05:46,757 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 407 transitions. Word has length 29 [2022-07-14 07:05:46,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:46,758 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 407 transitions. [2022-07-14 07:05:46,758 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-14 07:05:46,758 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 407 transitions. [2022-07-14 07:05:46,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 07:05:46,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:46,760 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-14 07:05:46,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 07:05:46,760 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:46,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:46,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1270637010, now seen corresponding path program 1 times [2022-07-14 07:05:46,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:46,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068853545] [2022-07-14 07:05:46,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:46,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:46,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:46,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:46,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068853545] [2022-07-14 07:05:46,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068853545] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:46,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:46,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 07:05:46,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342245880] [2022-07-14 07:05:46,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:46,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 07:05:46,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:46,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 07:05:46,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 07:05:46,883 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-14 07:05:47,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:47,097 INFO L93 Difference]: Finished difference Result 307 states and 427 transitions. [2022-07-14 07:05:47,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 07:05:47,097 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-14 07:05:47,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:47,099 INFO L225 Difference]: With dead ends: 307 [2022-07-14 07:05:47,099 INFO L226 Difference]: Without dead ends: 306 [2022-07-14 07:05:47,099 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-14 07:05:47,100 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 323 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:47,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 823 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 07:05:47,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-14 07:05:47,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2022-07-14 07:05:47,107 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-14 07:05:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 422 transitions. [2022-07-14 07:05:47,108 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 422 transitions. Word has length 33 [2022-07-14 07:05:47,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:47,108 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 422 transitions. [2022-07-14 07:05:47,108 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-14 07:05:47,109 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 422 transitions. [2022-07-14 07:05:47,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 07:05:47,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:47,110 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-14 07:05:47,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 07:05:47,110 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:47,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:47,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1113906492, now seen corresponding path program 1 times [2022-07-14 07:05:47,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:47,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217936461] [2022-07-14 07:05:47,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:47,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:47,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:47,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217936461] [2022-07-14 07:05:47,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217936461] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:47,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:47,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 07:05:47,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509590073] [2022-07-14 07:05:47,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:47,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 07:05:47,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:47,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 07:05:47,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 07:05:47,209 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-14 07:05:47,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:47,397 INFO L93 Difference]: Finished difference Result 306 states and 425 transitions. [2022-07-14 07:05:47,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 07:05:47,398 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-14 07:05:47,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:47,401 INFO L225 Difference]: With dead ends: 306 [2022-07-14 07:05:47,401 INFO L226 Difference]: Without dead ends: 306 [2022-07-14 07:05:47,402 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-14 07:05:47,403 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.2s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:47,403 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.2s Time] [2022-07-14 07:05:47,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-14 07:05:47,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2022-07-14 07:05:47,414 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-14 07:05:47,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 421 transitions. [2022-07-14 07:05:47,415 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 421 transitions. Word has length 34 [2022-07-14 07:05:47,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:47,416 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 421 transitions. [2022-07-14 07:05:47,417 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-14 07:05:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 421 transitions. [2022-07-14 07:05:47,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 07:05:47,419 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:47,419 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-14 07:05:47,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 07:05:47,421 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:47,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:47,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2136327390, now seen corresponding path program 1 times [2022-07-14 07:05:47,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:47,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444840427] [2022-07-14 07:05:47,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:47,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:47,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:47,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444840427] [2022-07-14 07:05:47,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444840427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:47,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:47,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 07:05:47,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789650956] [2022-07-14 07:05:47,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:47,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 07:05:47,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:47,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 07:05:47,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 07:05:47,484 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-14 07:05:47,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:47,641 INFO L93 Difference]: Finished difference Result 282 states and 385 transitions. [2022-07-14 07:05:47,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:05:47,641 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-14 07:05:47,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:47,643 INFO L225 Difference]: With dead ends: 282 [2022-07-14 07:05:47,643 INFO L226 Difference]: Without dead ends: 282 [2022-07-14 07:05:47,644 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-14 07:05:47,644 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-14 07:05:47,644 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-14 07:05:47,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-14 07:05:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 268. [2022-07-14 07:05:47,650 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-14 07:05:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 370 transitions. [2022-07-14 07:05:47,651 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 370 transitions. Word has length 34 [2022-07-14 07:05:47,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:47,652 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 370 transitions. [2022-07-14 07:05:47,652 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-14 07:05:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 370 transitions. [2022-07-14 07:05:47,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 07:05:47,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:47,653 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-14 07:05:47,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 07:05:47,653 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:47,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:47,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2069817048, now seen corresponding path program 1 times [2022-07-14 07:05:47,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:47,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539142497] [2022-07-14 07:05:47,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:47,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:47,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:47,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539142497] [2022-07-14 07:05:47,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539142497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:47,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:47,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 07:05:47,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953562751] [2022-07-14 07:05:47,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:47,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 07:05:47,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:47,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 07:05:47,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 07:05:47,694 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-14 07:05:47,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:47,795 INFO L93 Difference]: Finished difference Result 290 states and 394 transitions. [2022-07-14 07:05:47,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 07:05:47,798 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-14 07:05:47,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:47,800 INFO L225 Difference]: With dead ends: 290 [2022-07-14 07:05:47,800 INFO L226 Difference]: Without dead ends: 290 [2022-07-14 07:05:47,801 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-14 07:05:47,802 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 296 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:47,803 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-14 07:05:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-14 07:05:47,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2022-07-14 07:05:47,809 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-14 07:05:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 368 transitions. [2022-07-14 07:05:47,812 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 368 transitions. Word has length 34 [2022-07-14 07:05:47,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:47,812 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 368 transitions. [2022-07-14 07:05:47,812 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-14 07:05:47,813 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 368 transitions. [2022-07-14 07:05:47,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-14 07:05:47,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:47,815 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-14 07:05:47,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 07:05:47,815 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:47,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:47,816 INFO L85 PathProgramCache]: Analyzing trace with hash -382146908, now seen corresponding path program 1 times [2022-07-14 07:05:47,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:47,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669485646] [2022-07-14 07:05:47,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:47,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:47,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:47,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669485646] [2022-07-14 07:05:47,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669485646] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:47,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:47,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 07:05:47,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292862837] [2022-07-14 07:05:47,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:47,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 07:05:47,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:47,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 07:05:47,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 07:05:47,869 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-14 07:05:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:47,934 INFO L93 Difference]: Finished difference Result 262 states and 356 transitions. [2022-07-14 07:05:47,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 07:05:47,935 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-14 07:05:47,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:47,936 INFO L225 Difference]: With dead ends: 262 [2022-07-14 07:05:47,936 INFO L226 Difference]: Without dead ends: 232 [2022-07-14 07:05:47,936 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-14 07:05:47,937 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 289 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:47,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 425 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:05:47,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-14 07:05:47,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 210. [2022-07-14 07:05:47,942 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-14 07:05:47,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 287 transitions. [2022-07-14 07:05:47,943 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 287 transitions. Word has length 35 [2022-07-14 07:05:47,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:47,943 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 287 transitions. [2022-07-14 07:05:47,943 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-14 07:05:47,944 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 287 transitions. [2022-07-14 07:05:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 07:05:47,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:47,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 07:05:47,945 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:47,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:47,946 INFO L85 PathProgramCache]: Analyzing trace with hash 758626562, now seen corresponding path program 1 times [2022-07-14 07:05:47,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:47,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087185249] [2022-07-14 07:05:47,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:47,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 07:05:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 07:05:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:47,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:47,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087185249] [2022-07-14 07:05:47,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087185249] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:47,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:47,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 07:05:47,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690143573] [2022-07-14 07:05:47,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:47,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 07:05:47,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:47,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 07:05:47,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 07:05:47,993 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-14 07:05:48,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:48,103 INFO L93 Difference]: Finished difference Result 208 states and 283 transitions. [2022-07-14 07:05:48,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 07:05:48,103 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-14 07:05:48,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:48,106 INFO L225 Difference]: With dead ends: 208 [2022-07-14 07:05:48,106 INFO L226 Difference]: Without dead ends: 208 [2022-07-14 07:05:48,106 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-14 07:05:48,106 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 84 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:48,107 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-14 07:05:48,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-14 07:05:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-07-14 07:05:48,111 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-14 07:05:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 283 transitions. [2022-07-14 07:05:48,112 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 283 transitions. Word has length 39 [2022-07-14 07:05:48,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:48,112 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 283 transitions. [2022-07-14 07:05:48,112 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-14 07:05:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 283 transitions. [2022-07-14 07:05:48,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 07:05:48,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:48,113 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-14 07:05:48,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 07:05:48,114 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:48,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:48,114 INFO L85 PathProgramCache]: Analyzing trace with hash 143802726, now seen corresponding path program 1 times [2022-07-14 07:05:48,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:48,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695894954] [2022-07-14 07:05:48,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:48,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:48,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:48,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695894954] [2022-07-14 07:05:48,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695894954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:48,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:48,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 07:05:48,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565371445] [2022-07-14 07:05:48,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:48,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 07:05:48,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:48,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 07:05:48,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 07:05:48,173 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-14 07:05:48,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:48,239 INFO L93 Difference]: Finished difference Result 217 states and 292 transitions. [2022-07-14 07:05:48,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 07:05:48,240 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-14 07:05:48,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:48,241 INFO L225 Difference]: With dead ends: 217 [2022-07-14 07:05:48,241 INFO L226 Difference]: Without dead ends: 186 [2022-07-14 07:05:48,242 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-14 07:05:48,242 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-14 07:05:48,243 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-14 07:05:48,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-14 07:05:48,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-07-14 07:05:48,247 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-14 07:05:48,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 251 transitions. [2022-07-14 07:05:48,248 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 251 transitions. Word has length 37 [2022-07-14 07:05:48,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:48,248 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 251 transitions. [2022-07-14 07:05:48,248 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-14 07:05:48,248 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 251 transitions. [2022-07-14 07:05:48,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 07:05:48,249 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:48,249 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-14 07:05:48,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 07:05:48,250 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:48,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:48,251 INFO L85 PathProgramCache]: Analyzing trace with hash -233541237, now seen corresponding path program 1 times [2022-07-14 07:05:48,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:48,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403177966] [2022-07-14 07:05:48,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:48,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:48,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:48,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:05:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:48,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:48,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403177966] [2022-07-14 07:05:48,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403177966] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:48,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:48,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 07:05:48,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541444182] [2022-07-14 07:05:48,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:48,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 07:05:48,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:48,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 07:05:48,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 07:05:48,327 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-14 07:05:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:48,484 INFO L93 Difference]: Finished difference Result 211 states and 282 transitions. [2022-07-14 07:05:48,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 07:05:48,485 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-14 07:05:48,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:48,489 INFO L225 Difference]: With dead ends: 211 [2022-07-14 07:05:48,489 INFO L226 Difference]: Without dead ends: 204 [2022-07-14 07:05:48,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-14 07:05:48,492 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-14 07:05:48,492 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-14 07:05:48,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-14 07:05:48,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 194. [2022-07-14 07:05:48,500 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-14 07:05:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 260 transitions. [2022-07-14 07:05:48,501 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 260 transitions. Word has length 41 [2022-07-14 07:05:48,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:48,502 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 260 transitions. [2022-07-14 07:05:48,503 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-14 07:05:48,503 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 260 transitions. [2022-07-14 07:05:48,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 07:05:48,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:48,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:48,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 07:05:48,504 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:48,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:48,505 INFO L85 PathProgramCache]: Analyzing trace with hash 131822704, now seen corresponding path program 1 times [2022-07-14 07:05:48,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:48,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169694535] [2022-07-14 07:05:48,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:48,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:48,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:48,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:05:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:48,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:48,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169694535] [2022-07-14 07:05:48,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169694535] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:48,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:48,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 07:05:48,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253238728] [2022-07-14 07:05:48,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:48,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 07:05:48,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:48,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 07:05:48,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 07:05:48,550 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-14 07:05:48,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:48,644 INFO L93 Difference]: Finished difference Result 207 states and 273 transitions. [2022-07-14 07:05:48,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:05:48,645 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-14 07:05:48,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:48,646 INFO L225 Difference]: With dead ends: 207 [2022-07-14 07:05:48,646 INFO L226 Difference]: Without dead ends: 205 [2022-07-14 07:05:48,646 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-14 07:05:48,647 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-14 07:05:48,647 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-14 07:05:48,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-14 07:05:48,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 196. [2022-07-14 07:05:48,650 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-14 07:05:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 261 transitions. [2022-07-14 07:05:48,651 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 261 transitions. Word has length 42 [2022-07-14 07:05:48,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:48,652 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 261 transitions. [2022-07-14 07:05:48,652 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-14 07:05:48,652 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 261 transitions. [2022-07-14 07:05:48,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 07:05:48,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:48,653 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-14 07:05:48,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 07:05:48,653 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:48,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:48,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1766604753, now seen corresponding path program 1 times [2022-07-14 07:05:48,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:48,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162164947] [2022-07-14 07:05:48,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:48,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:48,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:48,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:05:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:48,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:48,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:48,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162164947] [2022-07-14 07:05:48,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162164947] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:48,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:48,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 07:05:48,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448240492] [2022-07-14 07:05:48,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:48,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 07:05:48,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:48,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 07:05:48,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 07:05:48,720 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-14 07:05:48,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:48,895 INFO L93 Difference]: Finished difference Result 216 states and 286 transitions. [2022-07-14 07:05:48,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 07:05:48,895 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-14 07:05:48,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:48,896 INFO L225 Difference]: With dead ends: 216 [2022-07-14 07:05:48,896 INFO L226 Difference]: Without dead ends: 216 [2022-07-14 07:05:48,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-14 07:05:48,897 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-14 07:05:48,897 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-14 07:05:48,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-14 07:05:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 197. [2022-07-14 07:05:48,901 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-14 07:05:48,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 262 transitions. [2022-07-14 07:05:48,902 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 262 transitions. Word has length 43 [2022-07-14 07:05:48,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:48,902 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 262 transitions. [2022-07-14 07:05:48,902 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-14 07:05:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 262 transitions. [2022-07-14 07:05:48,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 07:05:48,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:48,903 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-14 07:05:48,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 07:05:48,904 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:48,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:48,904 INFO L85 PathProgramCache]: Analyzing trace with hash -446330305, now seen corresponding path program 1 times [2022-07-14 07:05:48,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:48,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908228944] [2022-07-14 07:05:48,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:48,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:48,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:48,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:05:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:48,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:48,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:48,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908228944] [2022-07-14 07:05:48,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908228944] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:48,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:48,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 07:05:48,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739822912] [2022-07-14 07:05:48,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:48,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 07:05:48,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:48,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 07:05:48,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 07:05:48,951 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-14 07:05:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:49,038 INFO L93 Difference]: Finished difference Result 194 states and 255 transitions. [2022-07-14 07:05:49,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 07:05:49,039 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-14 07:05:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:49,040 INFO L225 Difference]: With dead ends: 194 [2022-07-14 07:05:49,040 INFO L226 Difference]: Without dead ends: 186 [2022-07-14 07:05:49,040 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-14 07:05:49,041 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 67 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:49,041 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-14 07:05:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-14 07:05:49,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2022-07-14 07:05:49,044 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-14 07:05:49,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 246 transitions. [2022-07-14 07:05:49,045 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 246 transitions. Word has length 43 [2022-07-14 07:05:49,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:49,045 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 246 transitions. [2022-07-14 07:05:49,045 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-14 07:05:49,045 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 246 transitions. [2022-07-14 07:05:49,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 07:05:49,046 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:49,046 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-14 07:05:49,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 07:05:49,047 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:49,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:49,047 INFO L85 PathProgramCache]: Analyzing trace with hash 694033782, now seen corresponding path program 1 times [2022-07-14 07:05:49,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:49,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162998392] [2022-07-14 07:05:49,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:49,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:49,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:49,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:05:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:49,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:49,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:49,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162998392] [2022-07-14 07:05:49,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162998392] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:49,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:49,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 07:05:49,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116764356] [2022-07-14 07:05:49,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:49,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 07:05:49,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:49,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 07:05:49,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 07:05:49,122 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-14 07:05:49,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:49,194 INFO L93 Difference]: Finished difference Result 178 states and 237 transitions. [2022-07-14 07:05:49,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 07:05:49,195 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-14 07:05:49,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:49,196 INFO L225 Difference]: With dead ends: 178 [2022-07-14 07:05:49,196 INFO L226 Difference]: Without dead ends: 178 [2022-07-14 07:05:49,196 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-14 07:05:49,196 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 79 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:49,197 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-14 07:05:49,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-14 07:05:49,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-07-14 07:05:49,200 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-14 07:05:49,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 237 transitions. [2022-07-14 07:05:49,201 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 237 transitions. Word has length 44 [2022-07-14 07:05:49,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:49,201 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 237 transitions. [2022-07-14 07:05:49,201 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-14 07:05:49,201 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 237 transitions. [2022-07-14 07:05:49,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 07:05:49,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:49,202 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-14 07:05:49,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 07:05:49,202 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:49,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:49,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1239862159, now seen corresponding path program 1 times [2022-07-14 07:05:49,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:49,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394134932] [2022-07-14 07:05:49,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:49,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:49,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:49,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:49,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394134932] [2022-07-14 07:05:49,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394134932] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:49,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:49,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 07:05:49,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614741134] [2022-07-14 07:05:49,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:49,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 07:05:49,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:49,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 07:05:49,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 07:05:49,260 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-14 07:05:49,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:49,414 INFO L93 Difference]: Finished difference Result 176 states and 232 transitions. [2022-07-14 07:05:49,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 07:05:49,414 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-14 07:05:49,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:49,416 INFO L225 Difference]: With dead ends: 176 [2022-07-14 07:05:49,416 INFO L226 Difference]: Without dead ends: 176 [2022-07-14 07:05:49,417 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-14 07:05:49,417 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-14 07:05:49,417 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-14 07:05:49,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-14 07:05:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2022-07-14 07:05:49,423 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-14 07:05:49,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 230 transitions. [2022-07-14 07:05:49,424 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 230 transitions. Word has length 42 [2022-07-14 07:05:49,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:49,425 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 230 transitions. [2022-07-14 07:05:49,425 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-14 07:05:49,425 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 230 transitions. [2022-07-14 07:05:49,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 07:05:49,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:49,426 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-14 07:05:49,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 07:05:49,426 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:49,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:49,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1096582801, now seen corresponding path program 1 times [2022-07-14 07:05:49,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:49,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996286174] [2022-07-14 07:05:49,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:49,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:49,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:49,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:49,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:49,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996286174] [2022-07-14 07:05:49,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996286174] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:49,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:49,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 07:05:49,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182998216] [2022-07-14 07:05:49,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:49,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 07:05:49,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:49,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 07:05:49,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-14 07:05:49,501 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-14 07:05:49,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:49,646 INFO L93 Difference]: Finished difference Result 185 states and 241 transitions. [2022-07-14 07:05:49,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 07:05:49,647 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-14 07:05:49,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:49,648 INFO L225 Difference]: With dead ends: 185 [2022-07-14 07:05:49,648 INFO L226 Difference]: Without dead ends: 169 [2022-07-14 07:05:49,648 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-14 07:05:49,649 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-14 07:05:49,649 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-14 07:05:49,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-14 07:05:49,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-07-14 07:05:49,652 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-14 07:05:49,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 223 transitions. [2022-07-14 07:05:49,653 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 223 transitions. Word has length 42 [2022-07-14 07:05:49,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:49,653 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 223 transitions. [2022-07-14 07:05:49,654 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-14 07:05:49,654 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 223 transitions. [2022-07-14 07:05:49,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 07:05:49,655 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:49,655 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-14 07:05:49,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 07:05:49,655 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:49,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:49,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1105542194, now seen corresponding path program 1 times [2022-07-14 07:05:49,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:49,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651651693] [2022-07-14 07:05:49,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:49,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:49,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 07:05:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:49,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 07:05:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:49,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:49,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:49,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651651693] [2022-07-14 07:05:49,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651651693] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:49,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:49,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 07:05:49,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849132576] [2022-07-14 07:05:49,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:49,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 07:05:49,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:49,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 07:05:49,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 07:05:49,690 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-14 07:05:49,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:49,740 INFO L93 Difference]: Finished difference Result 170 states and 223 transitions. [2022-07-14 07:05:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 07:05:49,740 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-14 07:05:49,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:49,741 INFO L225 Difference]: With dead ends: 170 [2022-07-14 07:05:49,741 INFO L226 Difference]: Without dead ends: 168 [2022-07-14 07:05:49,742 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-14 07:05:49,744 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-14 07:05:49,744 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-14 07:05:49,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-14 07:05:49,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-07-14 07:05:49,750 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-14 07:05:49,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 218 transitions. [2022-07-14 07:05:49,751 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 218 transitions. Word has length 48 [2022-07-14 07:05:49,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:49,751 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 218 transitions. [2022-07-14 07:05:49,752 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-14 07:05:49,752 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 218 transitions. [2022-07-14 07:05:49,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 07:05:49,753 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:49,753 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-14 07:05:49,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 07:05:49,754 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:49,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:49,754 INFO L85 PathProgramCache]: Analyzing trace with hash 364909914, now seen corresponding path program 1 times [2022-07-14 07:05:49,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:49,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249470495] [2022-07-14 07:05:49,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:49,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:49,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 07:05:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:49,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 07:05:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:49,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:49,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:49,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249470495] [2022-07-14 07:05:49,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249470495] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:49,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:49,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 07:05:49,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627299140] [2022-07-14 07:05:49,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:49,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 07:05:49,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:49,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 07:05:49,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-14 07:05:49,831 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-14 07:05:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:49,989 INFO L93 Difference]: Finished difference Result 177 states and 227 transitions. [2022-07-14 07:05:49,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 07:05:49,990 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-14 07:05:49,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:49,991 INFO L225 Difference]: With dead ends: 177 [2022-07-14 07:05:49,991 INFO L226 Difference]: Without dead ends: 145 [2022-07-14 07:05:49,991 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-14 07:05:49,992 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-14 07:05:49,992 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-14 07:05:49,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-14 07:05:49,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-07-14 07:05:49,995 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-14 07:05:49,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 183 transitions. [2022-07-14 07:05:49,996 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 183 transitions. Word has length 49 [2022-07-14 07:05:49,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:49,996 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 183 transitions. [2022-07-14 07:05:49,996 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-14 07:05:49,996 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 183 transitions. [2022-07-14 07:05:49,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 07:05:49,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:49,997 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-14 07:05:49,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 07:05:49,997 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:49,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:49,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1292109318, now seen corresponding path program 1 times [2022-07-14 07:05:49,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:49,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412768392] [2022-07-14 07:05:49,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:49,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:50,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 07:05:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:50,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:50,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412768392] [2022-07-14 07:05:50,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412768392] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:50,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:50,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 07:05:50,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399819904] [2022-07-14 07:05:50,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:50,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 07:05:50,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:50,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 07:05:50,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 07:05:50,075 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-14 07:05:50,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:50,254 INFO L93 Difference]: Finished difference Result 192 states and 234 transitions. [2022-07-14 07:05:50,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 07:05:50,255 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-14 07:05:50,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:50,256 INFO L225 Difference]: With dead ends: 192 [2022-07-14 07:05:50,256 INFO L226 Difference]: Without dead ends: 180 [2022-07-14 07:05:50,256 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-14 07:05:50,257 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 323 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:50,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 692 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:05:50,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-14 07:05:50,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 151. [2022-07-14 07:05:50,261 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-14 07:05:50,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 190 transitions. [2022-07-14 07:05:50,261 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 190 transitions. Word has length 43 [2022-07-14 07:05:50,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:50,261 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 190 transitions. [2022-07-14 07:05:50,262 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-14 07:05:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 190 transitions. [2022-07-14 07:05:50,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 07:05:50,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:50,262 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-14 07:05:50,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 07:05:50,263 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:50,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:50,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1608018874, now seen corresponding path program 1 times [2022-07-14 07:05:50,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:50,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672181543] [2022-07-14 07:05:50,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:50,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:50,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 07:05:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:50,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:05:50,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672181543] [2022-07-14 07:05:50,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672181543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:50,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:50,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 07:05:50,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156811730] [2022-07-14 07:05:50,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:50,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 07:05:50,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:05:50,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 07:05:50,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-14 07:05:50,327 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-14 07:05:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:50,477 INFO L93 Difference]: Finished difference Result 162 states and 201 transitions. [2022-07-14 07:05:50,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 07:05:50,478 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-14 07:05:50,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:50,479 INFO L225 Difference]: With dead ends: 162 [2022-07-14 07:05:50,479 INFO L226 Difference]: Without dead ends: 129 [2022-07-14 07:05:50,479 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-14 07:05:50,480 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-14 07:05:50,480 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-14 07:05:50,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-14 07:05:50,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-14 07:05:50,483 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-14 07:05:50,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2022-07-14 07:05:50,483 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 43 [2022-07-14 07:05:50,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:50,484 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2022-07-14 07:05:50,484 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-14 07:05:50,484 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2022-07-14 07:05:50,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 07:05:50,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:50,485 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-14 07:05:50,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 07:05:50,485 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:50,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:50,486 INFO L85 PathProgramCache]: Analyzing trace with hash -825515977, now seen corresponding path program 1 times [2022-07-14 07:05:50,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:05:50,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463935727] [2022-07-14 07:05:50,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:50,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:05:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 07:05:50,498 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 07:05:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 07:05:50,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 07:05:50,545 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 07:05:50,546 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-07-14 07:05:50,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-07-14 07:05:50,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-14 07:05:50,551 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-14 07:05:50,554 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 07:05:50,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 07:05:50 BoogieIcfgContainer [2022-07-14 07:05:50,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 07:05:50,610 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 07:05:50,611 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 07:05:50,611 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 07:05:50,611 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:05:45" (3/4) ... [2022-07-14 07:05:50,613 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 07:05:50,614 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 07:05:50,614 INFO L158 Benchmark]: Toolchain (without parser) took 6369.19ms. Allocated memory was 81.8MB in the beginning and 146.8MB in the end (delta: 65.0MB). Free memory was 49.2MB in the beginning and 46.9MB in the end (delta: 2.3MB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. [2022-07-14 07:05:50,614 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 81.8MB. Free memory was 40.2MB in the beginning and 40.2MB in the end (delta: 41.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 07:05:50,615 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.29ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 48.9MB in the beginning and 70.0MB in the end (delta: -21.1MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2022-07-14 07:05:50,615 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.10ms. Allocated memory is still 100.7MB. Free memory was 70.0MB in the beginning and 66.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-14 07:05:50,615 INFO L158 Benchmark]: Boogie Preprocessor took 68.67ms. Allocated memory is still 100.7MB. Free memory was 66.4MB in the beginning and 63.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 07:05:50,615 INFO L158 Benchmark]: RCFGBuilder took 770.05ms. Allocated memory is still 100.7MB. Free memory was 63.7MB in the beginning and 51.2MB in the end (delta: 12.5MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2022-07-14 07:05:50,616 INFO L158 Benchmark]: TraceAbstraction took 4979.04ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 50.8MB in the beginning and 46.9MB in the end (delta: 3.9MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2022-07-14 07:05:50,616 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 146.8MB. Free memory is still 46.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 07:05:50,617 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.20ms. Allocated memory is still 81.8MB. Free memory was 40.2MB in the beginning and 40.2MB in the end (delta: 41.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.29ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 48.9MB in the beginning and 70.0MB in the end (delta: -21.1MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.10ms. Allocated memory is still 100.7MB. Free memory was 70.0MB in the beginning and 66.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.67ms. Allocated memory is still 100.7MB. Free memory was 66.4MB in the beginning and 63.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 770.05ms. Allocated memory is still 100.7MB. Free memory was 63.7MB in the beginning and 51.2MB in the end (delta: 12.5MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4979.04ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 50.8MB in the beginning and 46.9MB in the end (delta: 3.9MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 146.8MB. Free memory is still 46.9MB. 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: 4.9s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3672 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3636 mSDsluCounter, 18043 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12600 mSDsCounter, 503 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2788 IncrementalHoareTripleChecker+Invalid, 3291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 503 mSolverCounterUnsat, 5443 mSDtfsCounter, 2788 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.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=6, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 179 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s 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-14 07:05:50,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-?-f4b24e3 [2022-07-14 07:05:52,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 07:05:52,662 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 07:05:52,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 07:05:52,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 07:05:52,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 07:05:52,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 07:05:52,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 07:05:52,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 07:05:52,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 07:05:52,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 07:05:52,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 07:05:52,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 07:05:52,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 07:05:52,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 07:05:52,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 07:05:52,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 07:05:52,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 07:05:52,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 07:05:52,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 07:05:52,740 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 07:05:52,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 07:05:52,743 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 07:05:52,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 07:05:52,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 07:05:52,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 07:05:52,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 07:05:52,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 07:05:52,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 07:05:52,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 07:05:52,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 07:05:52,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 07:05:52,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 07:05:52,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 07:05:52,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 07:05:52,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 07:05:52,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 07:05:52,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 07:05:52,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 07:05:52,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 07:05:52,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 07:05:52,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 07:05:52,767 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-14 07:05:52,797 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 07:05:52,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 07:05:52,798 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 07:05:52,798 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 07:05:52,799 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 07:05:52,799 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 07:05:52,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 07:05:52,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 07:05:52,800 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 07:05:52,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 07:05:52,801 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 07:05:52,801 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 07:05:52,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 07:05:52,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 07:05:52,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 07:05:52,809 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 07:05:52,809 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 07:05:52,810 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 07:05:52,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 07:05:52,810 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 07:05:52,810 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 07:05:52,810 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 07:05:52,811 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 07:05:52,811 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 07:05:52,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 07:05:52,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 07:05:52,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 07:05:52,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 07:05:52,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 07:05:52,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 07:05:52,812 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 07:05:52,813 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 07:05:52,813 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 07:05:52,813 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-14 07:05:53,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 07:05:53,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 07:05:53,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 07:05:53,166 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 07:05:53,167 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 07:05:53,169 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-14 07:05:53,229 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85056f745/5f2ddbc9510d4f2bb7021be0979ee698/FLAG8bbd8a450 [2022-07-14 07:05:53,694 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 07:05:53,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2022-07-14 07:05:53,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85056f745/5f2ddbc9510d4f2bb7021be0979ee698/FLAG8bbd8a450 [2022-07-14 07:05:54,041 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85056f745/5f2ddbc9510d4f2bb7021be0979ee698 [2022-07-14 07:05:54,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 07:05:54,044 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 07:05:54,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 07:05:54,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 07:05:54,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 07:05:54,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 07:05:54" (1/1) ... [2022-07-14 07:05:54,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e2a6916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:54, skipping insertion in model container [2022-07-14 07:05:54,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 07:05:54" (1/1) ... [2022-07-14 07:05:54,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 07:05:54,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 07:05:54,350 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-14 07:05:54,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 07:05:54,373 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 07:05:54,432 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-14 07:05:54,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 07:05:54,454 INFO L208 MainTranslator]: Completed translation [2022-07-14 07:05:54,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:54 WrapperNode [2022-07-14 07:05:54,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 07:05:54,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 07:05:54,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 07:05:54,456 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 07:05:54,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:54" (1/1) ... [2022-07-14 07:05:54,480 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:54" (1/1) ... [2022-07-14 07:05:54,515 INFO L137 Inliner]: procedures = 29, calls = 44, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 607 [2022-07-14 07:05:54,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 07:05:54,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 07:05:54,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 07:05:54,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 07:05:54,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:54" (1/1) ... [2022-07-14 07:05:54,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:54" (1/1) ... [2022-07-14 07:05:54,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:54" (1/1) ... [2022-07-14 07:05:54,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:54" (1/1) ... [2022-07-14 07:05:54,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:54" (1/1) ... [2022-07-14 07:05:54,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:54" (1/1) ... [2022-07-14 07:05:54,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:54" (1/1) ... [2022-07-14 07:05:54,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 07:05:54,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 07:05:54,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 07:05:54,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 07:05:54,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:54" (1/1) ... [2022-07-14 07:05:54,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 07:05:54,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:05:54,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 07:05:54,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 07:05:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 07:05:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-07-14 07:05:54,638 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-07-14 07:05:54,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 07:05:54,639 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-14 07:05:54,639 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-14 07:05:54,639 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-07-14 07:05:54,639 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-07-14 07:05:54,640 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-14 07:05:54,640 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-14 07:05:54,640 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-14 07:05:54,640 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-14 07:05:54,640 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-14 07:05:54,640 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-14 07:05:54,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 07:05:54,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 07:05:54,640 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-07-14 07:05:54,640 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-07-14 07:05:54,795 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 07:05:54,796 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 07:05:54,948 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 07:05:54,961 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 07:05:54,964 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 07:05:54,970 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 07:05:54,976 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 07:05:55,393 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume !false; [2022-07-14 07:05:55,394 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume false; [2022-07-14 07:05:55,394 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##63: assume !false; [2022-07-14 07:05:55,394 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume false; [2022-07-14 07:05:55,394 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume false; [2022-07-14 07:05:55,394 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !false; [2022-07-14 07:05:55,394 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-07-14 07:05:55,395 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-07-14 07:05:55,395 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume !false; [2022-07-14 07:05:55,395 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume false; [2022-07-14 07:05:55,411 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 07:05:55,437 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-07-14 07:05:55,437 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-07-14 07:05:55,443 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 07:05:55,451 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 07:05:55,454 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 07:05:55,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:05:55 BoogieIcfgContainer [2022-07-14 07:05:55,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 07:05:55,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 07:05:55,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 07:05:55,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 07:05:55,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 07:05:54" (1/3) ... [2022-07-14 07:05:55,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ca917f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 07:05:55, skipping insertion in model container [2022-07-14 07:05:55,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:05:54" (2/3) ... [2022-07-14 07:05:55,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ca917f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 07:05:55, skipping insertion in model container [2022-07-14 07:05:55,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:05:55" (3/3) ... [2022-07-14 07:05:55,464 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2022-07-14 07:05:55,478 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 07:05:55,478 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-14 07:05:55,524 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 07:05:55,529 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@43054646, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1496dab5 [2022-07-14 07:05:55,529 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-14 07:05:55,534 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-14 07:05:55,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 07:05:55,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:55,540 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:55,540 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:55,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:55,545 INFO L85 PathProgramCache]: Analyzing trace with hash -15799092, now seen corresponding path program 1 times [2022-07-14 07:05:55,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:05:55,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010298455] [2022-07-14 07:05:55,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:55,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:05:55,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:05:55,563 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-14 07:05:55,566 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-14 07:05:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:55,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 07:05:55,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:05:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:55,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:05:55,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:05:55,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010298455] [2022-07-14 07:05:55,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010298455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:55,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:55,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:05:55,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590175482] [2022-07-14 07:05:55,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:55,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:05:55,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:05:55,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:05:55,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:05:55,746 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-14 07:05:55,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:55,827 INFO L93 Difference]: Finished difference Result 212 states and 315 transitions. [2022-07-14 07:05:55,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:05:55,829 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-14 07:05:55,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:55,838 INFO L225 Difference]: With dead ends: 212 [2022-07-14 07:05:55,838 INFO L226 Difference]: Without dead ends: 208 [2022-07-14 07:05:55,839 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-14 07:05:55,842 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-14 07:05:55,843 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-14 07:05:55,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-14 07:05:55,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2022-07-14 07:05:55,901 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-14 07:05:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 310 transitions. [2022-07-14 07:05:55,907 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 310 transitions. Word has length 8 [2022-07-14 07:05:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:55,907 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 310 transitions. [2022-07-14 07:05:55,907 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-14 07:05:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 310 transitions. [2022-07-14 07:05:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 07:05:55,908 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:55,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:55,920 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-14 07:05:56,117 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-14 07:05:56,118 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:56,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:56,118 INFO L85 PathProgramCache]: Analyzing trace with hash -191249986, now seen corresponding path program 1 times [2022-07-14 07:05:56,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:05:56,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346836695] [2022-07-14 07:05:56,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:56,120 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:05:56,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:05:56,124 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-14 07:05:56,126 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-14 07:05:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:56,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 07:05:56,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:05:56,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:56,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:05:56,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:05:56,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346836695] [2022-07-14 07:05:56,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346836695] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:56,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:56,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:05:56,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550636846] [2022-07-14 07:05:56,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:56,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:05:56,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:05:56,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:05:56,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:05:56,243 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-14 07:05:56,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:56,295 INFO L93 Difference]: Finished difference Result 205 states and 309 transitions. [2022-07-14 07:05:56,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:05:56,296 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-14 07:05:56,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:56,298 INFO L225 Difference]: With dead ends: 205 [2022-07-14 07:05:56,298 INFO L226 Difference]: Without dead ends: 201 [2022-07-14 07:05:56,299 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-14 07:05:56,300 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-14 07:05:56,300 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-14 07:05:56,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-14 07:05:56,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-07-14 07:05:56,319 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-14 07:05:56,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 296 transitions. [2022-07-14 07:05:56,326 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 296 transitions. Word has length 15 [2022-07-14 07:05:56,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:56,326 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 296 transitions. [2022-07-14 07:05:56,327 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-14 07:05:56,327 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 296 transitions. [2022-07-14 07:05:56,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 07:05:56,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:56,329 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-14 07:05:56,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-14 07:05:56,537 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-14 07:05:56,538 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:56,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:56,539 INFO L85 PathProgramCache]: Analyzing trace with hash 509601447, now seen corresponding path program 1 times [2022-07-14 07:05:56,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:05:56,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311523535] [2022-07-14 07:05:56,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:56,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:05:56,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:05:56,542 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-14 07:05:56,545 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-14 07:05:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:56,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 07:05:56,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:05:56,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:56,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:05:56,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:05:56,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311523535] [2022-07-14 07:05:56,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311523535] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:56,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:56,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 07:05:56,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623048066] [2022-07-14 07:05:56,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:56,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 07:05:56,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:05:56,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 07:05:56,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 07:05:56,787 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-14 07:05:56,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:56,982 INFO L93 Difference]: Finished difference Result 269 states and 381 transitions. [2022-07-14 07:05:56,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 07:05:56,983 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-14 07:05:56,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:56,986 INFO L225 Difference]: With dead ends: 269 [2022-07-14 07:05:56,986 INFO L226 Difference]: Without dead ends: 268 [2022-07-14 07:05:56,986 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-14 07:05:56,989 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 360 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:56,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 395 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 07:05:56,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-14 07:05:57,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 252. [2022-07-14 07:05:57,009 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-14 07:05:57,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 361 transitions. [2022-07-14 07:05:57,012 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 361 transitions. Word has length 19 [2022-07-14 07:05:57,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:57,012 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 361 transitions. [2022-07-14 07:05:57,012 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-14 07:05:57,012 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 361 transitions. [2022-07-14 07:05:57,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 07:05:57,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:57,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:05:57,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-14 07:05:57,227 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-14 07:05:57,228 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:57,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:57,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2016043468, now seen corresponding path program 1 times [2022-07-14 07:05:57,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:05:57,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082693776] [2022-07-14 07:05:57,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:57,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:05:57,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:05:57,231 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-14 07:05:57,232 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-14 07:05:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:57,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 07:05:57,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:05:57,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:57,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:05:57,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:05:57,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082693776] [2022-07-14 07:05:57,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082693776] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:57,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:57,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:05:57,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713110818] [2022-07-14 07:05:57,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:57,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:05:57,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:05:57,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:05:57,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:05:57,363 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-14 07:05:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:57,382 INFO L93 Difference]: Finished difference Result 312 states and 436 transitions. [2022-07-14 07:05:57,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:05:57,383 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-14 07:05:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:57,385 INFO L225 Difference]: With dead ends: 312 [2022-07-14 07:05:57,385 INFO L226 Difference]: Without dead ends: 312 [2022-07-14 07:05:57,385 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-14 07:05:57,386 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-14 07:05:57,387 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-14 07:05:57,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-14 07:05:57,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 290. [2022-07-14 07:05:57,398 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-14 07:05:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 410 transitions. [2022-07-14 07:05:57,400 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 410 transitions. Word has length 18 [2022-07-14 07:05:57,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:57,401 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 410 transitions. [2022-07-14 07:05:57,401 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-14 07:05:57,401 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 410 transitions. [2022-07-14 07:05:57,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 07:05:57,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:57,403 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-14 07:05:57,421 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-14 07:05:57,622 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-14 07:05:57,622 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:57,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:57,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1363549369, now seen corresponding path program 1 times [2022-07-14 07:05:57,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:05:57,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065095222] [2022-07-14 07:05:57,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:57,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:05:57,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:05:57,625 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-14 07:05:57,626 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-14 07:05:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:57,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 07:05:57,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:05:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:57,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:05:57,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:05:57,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065095222] [2022-07-14 07:05:57,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065095222] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:57,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:57,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 07:05:57,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635627727] [2022-07-14 07:05:57,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:57,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 07:05:57,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:05:57,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 07:05:57,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 07:05:57,811 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-14 07:05:57,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:57,944 INFO L93 Difference]: Finished difference Result 289 states and 407 transitions. [2022-07-14 07:05:57,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 07:05:57,945 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-14 07:05:57,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:57,952 INFO L225 Difference]: With dead ends: 289 [2022-07-14 07:05:57,952 INFO L226 Difference]: Without dead ends: 289 [2022-07-14 07:05:57,952 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-14 07:05:57,954 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-14 07:05:57,954 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-14 07:05:57,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-14 07:05:57,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2022-07-14 07:05:57,965 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-14 07:05:57,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 407 transitions. [2022-07-14 07:05:57,967 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 407 transitions. Word has length 29 [2022-07-14 07:05:57,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:57,968 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 407 transitions. [2022-07-14 07:05:57,968 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-14 07:05:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 407 transitions. [2022-07-14 07:05:57,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 07:05:57,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:57,971 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-14 07:05:57,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-14 07:05:58,180 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-14 07:05:58,181 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:58,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:58,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1270637010, now seen corresponding path program 1 times [2022-07-14 07:05:58,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:05:58,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587529230] [2022-07-14 07:05:58,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:58,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:05:58,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:05:58,183 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-14 07:05:58,183 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-14 07:05:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:58,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 07:05:58,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:05:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:58,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:05:58,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:05:58,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587529230] [2022-07-14 07:05:58,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587529230] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:58,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:58,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 07:05:58,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920617244] [2022-07-14 07:05:58,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:58,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 07:05:58,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:05:58,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 07:05:58,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 07:05:58,421 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-14 07:05:58,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:58,591 INFO L93 Difference]: Finished difference Result 307 states and 427 transitions. [2022-07-14 07:05:58,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 07:05:58,592 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-14 07:05:58,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:58,594 INFO L225 Difference]: With dead ends: 307 [2022-07-14 07:05:58,594 INFO L226 Difference]: Without dead ends: 306 [2022-07-14 07:05:58,594 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-14 07:05:58,595 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 271 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 07:05:58,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 653 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 07:05:58,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-14 07:05:58,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2022-07-14 07:05:58,606 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-14 07:05:58,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 422 transitions. [2022-07-14 07:05:58,609 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 422 transitions. Word has length 33 [2022-07-14 07:05:58,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:58,609 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 422 transitions. [2022-07-14 07:05:58,610 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-14 07:05:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 422 transitions. [2022-07-14 07:05:58,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 07:05:58,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:58,613 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-14 07:05:58,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-14 07:05:58,827 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-14 07:05:58,827 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:58,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:58,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1113906492, now seen corresponding path program 1 times [2022-07-14 07:05:58,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:05:58,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089543784] [2022-07-14 07:05:58,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:58,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:05:58,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:05:58,830 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-14 07:05:58,834 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-14 07:05:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:58,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 07:05:58,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:05:59,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:59,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:05:59,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:05:59,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089543784] [2022-07-14 07:05:59,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089543784] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:59,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:59,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 07:05:59,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083845639] [2022-07-14 07:05:59,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:59,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 07:05:59,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:05:59,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 07:05:59,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 07:05:59,025 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-14 07:05:59,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:59,183 INFO L93 Difference]: Finished difference Result 306 states and 425 transitions. [2022-07-14 07:05:59,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 07:05:59,183 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-14 07:05:59,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:59,185 INFO L225 Difference]: With dead ends: 306 [2022-07-14 07:05:59,185 INFO L226 Difference]: Without dead ends: 306 [2022-07-14 07:05:59,186 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-14 07:05:59,186 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-14 07:05:59,186 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-14 07:05:59,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-14 07:05:59,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2022-07-14 07:05:59,193 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-14 07:05:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 421 transitions. [2022-07-14 07:05:59,195 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 421 transitions. Word has length 34 [2022-07-14 07:05:59,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:59,196 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 421 transitions. [2022-07-14 07:05:59,196 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-14 07:05:59,196 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 421 transitions. [2022-07-14 07:05:59,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 07:05:59,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:59,197 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-14 07:05:59,209 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-14 07:05:59,406 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-14 07:05:59,407 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:59,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:59,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2136327390, now seen corresponding path program 1 times [2022-07-14 07:05:59,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:05:59,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247720684] [2022-07-14 07:05:59,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:59,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:05:59,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:05:59,409 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-14 07:05:59,410 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-14 07:05:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:59,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 07:05:59,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:05:59,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:59,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:05:59,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:05:59,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247720684] [2022-07-14 07:05:59,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247720684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:59,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:59,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:05:59,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57404301] [2022-07-14 07:05:59,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:59,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:05:59,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:05:59,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:05:59,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:05:59,500 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-14 07:05:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:05:59,515 INFO L93 Difference]: Finished difference Result 282 states and 385 transitions. [2022-07-14 07:05:59,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:05:59,515 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-14 07:05:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:05:59,517 INFO L225 Difference]: With dead ends: 282 [2022-07-14 07:05:59,517 INFO L226 Difference]: Without dead ends: 282 [2022-07-14 07:05:59,517 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-14 07:05:59,518 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-14 07:05:59,518 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-14 07:05:59,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-14 07:05:59,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 268. [2022-07-14 07:05:59,524 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-14 07:05:59,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 370 transitions. [2022-07-14 07:05:59,526 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 370 transitions. Word has length 34 [2022-07-14 07:05:59,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:05:59,526 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 370 transitions. [2022-07-14 07:05:59,526 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-14 07:05:59,526 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 370 transitions. [2022-07-14 07:05:59,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 07:05:59,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:05:59,527 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-14 07:05:59,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-14 07:05:59,736 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-14 07:05:59,737 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:05:59,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:05:59,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2069817048, now seen corresponding path program 1 times [2022-07-14 07:05:59,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:05:59,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790139820] [2022-07-14 07:05:59,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:05:59,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:05:59,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:05:59,739 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-14 07:05:59,739 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-14 07:05:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:05:59,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 07:05:59,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:05:59,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:05:59,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:05:59,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:05:59,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790139820] [2022-07-14 07:05:59,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790139820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:05:59,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:05:59,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 07:05:59,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675454552] [2022-07-14 07:05:59,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:05:59,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 07:05:59,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:05:59,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 07:05:59,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 07:05:59,906 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-14 07:06:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:00,029 INFO L93 Difference]: Finished difference Result 268 states and 368 transitions. [2022-07-14 07:06:00,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 07:06:00,030 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-14 07:06:00,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:00,031 INFO L225 Difference]: With dead ends: 268 [2022-07-14 07:06:00,031 INFO L226 Difference]: Without dead ends: 268 [2022-07-14 07:06:00,032 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-14 07:06:00,032 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-14 07:06:00,032 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-14 07:06:00,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-14 07:06:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2022-07-14 07:06:00,038 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-14 07:06:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 368 transitions. [2022-07-14 07:06:00,040 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 368 transitions. Word has length 34 [2022-07-14 07:06:00,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:00,040 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 368 transitions. [2022-07-14 07:06:00,040 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-14 07:06:00,041 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 368 transitions. [2022-07-14 07:06:00,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-14 07:06:00,041 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:00,042 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-14 07:06:00,058 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-14 07:06:00,258 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-14 07:06:00,258 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:00,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:00,258 INFO L85 PathProgramCache]: Analyzing trace with hash -382146908, now seen corresponding path program 1 times [2022-07-14 07:06:00,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:00,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094174495] [2022-07-14 07:06:00,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:00,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:00,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:00,260 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-14 07:06:00,261 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-14 07:06:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:00,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 07:06:00,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:00,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:00,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:00,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094174495] [2022-07-14 07:06:00,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094174495] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:00,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:00,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:06:00,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552498531] [2022-07-14 07:06:00,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:00,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:06:00,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:00,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:06:00,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:06:00,383 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-14 07:06:00,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:00,397 INFO L93 Difference]: Finished difference Result 262 states and 356 transitions. [2022-07-14 07:06:00,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:06:00,397 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-14 07:06:00,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:00,398 INFO L225 Difference]: With dead ends: 262 [2022-07-14 07:06:00,399 INFO L226 Difference]: Without dead ends: 232 [2022-07-14 07:06:00,399 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-14 07:06:00,399 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-14 07:06:00,400 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-14 07:06:00,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-14 07:06:00,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 210. [2022-07-14 07:06:00,405 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-14 07:06:00,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 287 transitions. [2022-07-14 07:06:00,406 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 287 transitions. Word has length 35 [2022-07-14 07:06:00,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:00,406 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 287 transitions. [2022-07-14 07:06:00,406 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-14 07:06:00,407 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 287 transitions. [2022-07-14 07:06:00,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 07:06:00,407 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:00,408 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-14 07:06:00,422 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-14 07:06:00,622 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-14 07:06:00,622 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:00,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:00,623 INFO L85 PathProgramCache]: Analyzing trace with hash 758626562, now seen corresponding path program 1 times [2022-07-14 07:06:00,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:00,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123479337] [2022-07-14 07:06:00,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:00,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:00,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:00,624 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-14 07:06:00,625 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-14 07:06:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:00,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 07:06:00,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:00,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:00,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:00,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123479337] [2022-07-14 07:06:00,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123479337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:00,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:00,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:06:00,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986433383] [2022-07-14 07:06:00,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:00,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:06:00,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:00,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:06:00,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:06:00,742 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-14 07:06:00,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:00,787 INFO L93 Difference]: Finished difference Result 208 states and 283 transitions. [2022-07-14 07:06:00,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:06:00,787 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-14 07:06:00,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:00,789 INFO L225 Difference]: With dead ends: 208 [2022-07-14 07:06:00,789 INFO L226 Difference]: Without dead ends: 208 [2022-07-14 07:06:00,789 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-14 07:06:00,789 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-14 07:06:00,790 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-14 07:06:00,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-14 07:06:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-07-14 07:06:00,794 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-14 07:06:00,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 283 transitions. [2022-07-14 07:06:00,796 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 283 transitions. Word has length 39 [2022-07-14 07:06:00,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:00,796 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 283 transitions. [2022-07-14 07:06:00,796 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-14 07:06:00,796 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 283 transitions. [2022-07-14 07:06:00,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 07:06:00,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:00,797 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-14 07:06:00,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-14 07:06:01,011 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-14 07:06:01,012 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:01,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:01,012 INFO L85 PathProgramCache]: Analyzing trace with hash 143802726, now seen corresponding path program 1 times [2022-07-14 07:06:01,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:01,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586745624] [2022-07-14 07:06:01,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:01,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:01,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:01,014 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-14 07:06:01,015 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-14 07:06:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:01,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 07:06:01,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:01,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:01,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:01,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586745624] [2022-07-14 07:06:01,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586745624] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:01,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:01,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 07:06:01,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820879288] [2022-07-14 07:06:01,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:01,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 07:06:01,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:01,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 07:06:01,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 07:06:01,177 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-14 07:06:01,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:01,326 INFO L93 Difference]: Finished difference Result 224 states and 301 transitions. [2022-07-14 07:06:01,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:06:01,327 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-14 07:06:01,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:01,328 INFO L225 Difference]: With dead ends: 224 [2022-07-14 07:06:01,328 INFO L226 Difference]: Without dead ends: 207 [2022-07-14 07:06:01,328 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-14 07:06:01,329 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-14 07:06:01,329 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-14 07:06:01,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-14 07:06:01,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-07-14 07:06:01,333 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-14 07:06:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 281 transitions. [2022-07-14 07:06:01,335 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 281 transitions. Word has length 37 [2022-07-14 07:06:01,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:01,335 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 281 transitions. [2022-07-14 07:06:01,335 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-14 07:06:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 281 transitions. [2022-07-14 07:06:01,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 07:06:01,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:01,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] [2022-07-14 07:06:01,347 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-14 07:06:01,537 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-14 07:06:01,537 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:01,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:01,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1174329751, now seen corresponding path program 1 times [2022-07-14 07:06:01,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:01,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246882452] [2022-07-14 07:06:01,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:01,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:01,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:01,540 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-14 07:06:01,542 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-14 07:06:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:01,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 07:06:01,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:01,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-14 07:06:01,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:01,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:01,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246882452] [2022-07-14 07:06:01,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246882452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:01,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:01,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 07:06:01,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106204625] [2022-07-14 07:06:01,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:01,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 07:06:01,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:01,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 07:06:01,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 07:06:01,705 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-14 07:06:01,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:01,819 INFO L93 Difference]: Finished difference Result 223 states and 299 transitions. [2022-07-14 07:06:01,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 07:06:01,819 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-14 07:06:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:01,820 INFO L225 Difference]: With dead ends: 223 [2022-07-14 07:06:01,820 INFO L226 Difference]: Without dead ends: 206 [2022-07-14 07:06:01,821 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-14 07:06:01,821 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.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:01,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1166 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:06:01,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-14 07:06:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-07-14 07:06:01,825 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-14 07:06:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 279 transitions. [2022-07-14 07:06:01,826 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 279 transitions. Word has length 38 [2022-07-14 07:06:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:01,826 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 279 transitions. [2022-07-14 07:06:01,827 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-14 07:06:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 279 transitions. [2022-07-14 07:06:01,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 07:06:01,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:01,828 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-14 07:06:01,839 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-14 07:06:02,039 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-14 07:06:02,040 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:02,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:02,040 INFO L85 PathProgramCache]: Analyzing trace with hash -461855063, now seen corresponding path program 1 times [2022-07-14 07:06:02,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:02,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416452434] [2022-07-14 07:06:02,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:02,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:02,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:02,042 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-14 07:06:02,044 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-14 07:06:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:02,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 07:06:02,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:02,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:02,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:02,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416452434] [2022-07-14 07:06:02,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416452434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:02,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:02,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 07:06:02,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704966202] [2022-07-14 07:06:02,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:02,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 07:06:02,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:02,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 07:06:02,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 07:06:02,198 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-14 07:06:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:02,296 INFO L93 Difference]: Finished difference Result 215 states and 288 transitions. [2022-07-14 07:06:02,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 07:06:02,296 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-14 07:06:02,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:02,297 INFO L225 Difference]: With dead ends: 215 [2022-07-14 07:06:02,306 INFO L226 Difference]: Without dead ends: 186 [2022-07-14 07:06:02,307 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-14 07:06:02,307 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-14 07:06:02,307 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-14 07:06:02,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-14 07:06:02,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-07-14 07:06:02,312 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-14 07:06:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 251 transitions. [2022-07-14 07:06:02,313 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 251 transitions. Word has length 38 [2022-07-14 07:06:02,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:02,314 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 251 transitions. [2022-07-14 07:06:02,314 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-14 07:06:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 251 transitions. [2022-07-14 07:06:02,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 07:06:02,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:02,315 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-14 07:06:02,326 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-14 07:06:02,524 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-14 07:06:02,524 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:02,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:02,525 INFO L85 PathProgramCache]: Analyzing trace with hash -233541237, now seen corresponding path program 1 times [2022-07-14 07:06:02,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:02,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951740554] [2022-07-14 07:06:02,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:02,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:02,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:02,527 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-14 07:06:02,529 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-14 07:06:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:02,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 07:06:02,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:02,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:02,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:02,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951740554] [2022-07-14 07:06:02,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951740554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:02,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:02,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 07:06:02,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795565685] [2022-07-14 07:06:02,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:02,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 07:06:02,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:02,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 07:06:02,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 07:06:02,650 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-14 07:06:02,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:02,666 INFO L93 Difference]: Finished difference Result 179 states and 241 transitions. [2022-07-14 07:06:02,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 07:06:02,666 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-14 07:06:02,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:02,667 INFO L225 Difference]: With dead ends: 179 [2022-07-14 07:06:02,667 INFO L226 Difference]: Without dead ends: 179 [2022-07-14 07:06:02,669 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-14 07:06:02,669 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-14 07:06:02,670 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-14 07:06:02,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-14 07:06:02,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2022-07-14 07:06:02,675 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-14 07:06:02,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 241 transitions. [2022-07-14 07:06:02,677 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 241 transitions. Word has length 41 [2022-07-14 07:06:02,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:02,677 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 241 transitions. [2022-07-14 07:06:02,677 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-14 07:06:02,678 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 241 transitions. [2022-07-14 07:06:02,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 07:06:02,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:02,679 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-14 07:06:02,693 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-14 07:06:02,888 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-14 07:06:02,888 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:02,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:02,888 INFO L85 PathProgramCache]: Analyzing trace with hash 348485743, now seen corresponding path program 1 times [2022-07-14 07:06:02,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:02,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688990593] [2022-07-14 07:06:02,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:02,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:02,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:02,890 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-14 07:06:02,891 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-14 07:06:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:02,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 07:06:02,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:03,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:03,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:03,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688990593] [2022-07-14 07:06:03,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688990593] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:03,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:03,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 07:06:03,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008354887] [2022-07-14 07:06:03,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:03,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 07:06:03,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:03,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 07:06:03,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 07:06:03,074 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-14 07:06:03,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:03,236 INFO L93 Difference]: Finished difference Result 178 states and 238 transitions. [2022-07-14 07:06:03,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:06:03,237 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-14 07:06:03,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:03,238 INFO L225 Difference]: With dead ends: 178 [2022-07-14 07:06:03,238 INFO L226 Difference]: Without dead ends: 178 [2022-07-14 07:06:03,238 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-14 07:06:03,238 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-14 07:06:03,239 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-14 07:06:03,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-14 07:06:03,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-07-14 07:06:03,242 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-14 07:06:03,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 238 transitions. [2022-07-14 07:06:03,244 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 238 transitions. Word has length 42 [2022-07-14 07:06:03,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:03,244 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 238 transitions. [2022-07-14 07:06:03,244 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-14 07:06:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 238 transitions. [2022-07-14 07:06:03,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 07:06:03,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:03,245 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-14 07:06:03,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-14 07:06:03,454 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-14 07:06:03,455 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:03,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:03,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1096582801, now seen corresponding path program 1 times [2022-07-14 07:06:03,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:03,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40120741] [2022-07-14 07:06:03,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:03,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:03,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:03,457 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-14 07:06:03,463 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-14 07:06:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:03,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 07:06:03,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:03,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:03,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:03,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40120741] [2022-07-14 07:06:03,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40120741] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:03,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:03,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 07:06:03,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921979817] [2022-07-14 07:06:03,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:03,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 07:06:03,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:03,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 07:06:03,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 07:06:03,636 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-14 07:06:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:03,835 INFO L93 Difference]: Finished difference Result 231 states and 302 transitions. [2022-07-14 07:06:03,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 07:06:03,836 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-14 07:06:03,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:03,837 INFO L225 Difference]: With dead ends: 231 [2022-07-14 07:06:03,837 INFO L226 Difference]: Without dead ends: 218 [2022-07-14 07:06:03,837 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-14 07:06:03,838 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-14 07:06:03,838 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-14 07:06:03,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-14 07:06:03,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 187. [2022-07-14 07:06:03,843 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-14 07:06:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 249 transitions. [2022-07-14 07:06:03,844 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 249 transitions. Word has length 42 [2022-07-14 07:06:03,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:03,844 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 249 transitions. [2022-07-14 07:06:03,844 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-14 07:06:03,844 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 249 transitions. [2022-07-14 07:06:03,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 07:06:03,845 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:03,845 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-14 07:06:03,863 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-14 07:06:04,055 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-14 07:06:04,055 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:04,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:04,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1105542194, now seen corresponding path program 1 times [2022-07-14 07:06:04,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:04,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408393521] [2022-07-14 07:06:04,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:04,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:04,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:04,058 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-14 07:06:04,059 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-14 07:06:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:04,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 07:06:04,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:04,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-14 07:06:04,141 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:04,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:04,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408393521] [2022-07-14 07:06:04,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408393521] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:04,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:04,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:06:04,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058399706] [2022-07-14 07:06:04,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:04,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:06:04,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:04,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:06:04,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:06:04,145 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-14 07:06:04,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:04,154 INFO L93 Difference]: Finished difference Result 188 states and 249 transitions. [2022-07-14 07:06:04,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:06:04,155 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-14 07:06:04,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:04,156 INFO L225 Difference]: With dead ends: 188 [2022-07-14 07:06:04,156 INFO L226 Difference]: Without dead ends: 187 [2022-07-14 07:06:04,156 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-14 07:06:04,157 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-14 07:06:04,157 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-14 07:06:04,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-14 07:06:04,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-14 07:06:04,164 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-14 07:06:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 248 transitions. [2022-07-14 07:06:04,166 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 248 transitions. Word has length 48 [2022-07-14 07:06:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:04,166 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 248 transitions. [2022-07-14 07:06:04,166 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-14 07:06:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 248 transitions. [2022-07-14 07:06:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 07:06:04,167 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:04,177 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-14 07:06:04,377 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-14 07:06:04,377 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:04,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:04,377 INFO L85 PathProgramCache]: Analyzing trace with hash 437296472, now seen corresponding path program 1 times [2022-07-14 07:06:04,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:04,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762299219] [2022-07-14 07:06:04,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:04,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:04,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:04,380 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-14 07:06:04,423 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-14 07:06:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:04,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 07:06:04,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:04,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:04,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:04,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:04,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762299219] [2022-07-14 07:06:04,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762299219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:04,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:04,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:06:04,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646690303] [2022-07-14 07:06:04,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:04,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:06:04,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:04,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:06:04,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:06:04,485 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-14 07:06:04,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:04,493 INFO L93 Difference]: Finished difference Result 188 states and 248 transitions. [2022-07-14 07:06:04,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:06:04,494 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-14 07:06:04,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:04,495 INFO L225 Difference]: With dead ends: 188 [2022-07-14 07:06:04,496 INFO L226 Difference]: Without dead ends: 187 [2022-07-14 07:06:04,496 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-14 07:06:04,496 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-14 07:06:04,497 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-14 07:06:04,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-14 07:06:04,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-14 07:06:04,509 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-14 07:06:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 246 transitions. [2022-07-14 07:06:04,510 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 246 transitions. Word has length 49 [2022-07-14 07:06:04,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:04,510 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 246 transitions. [2022-07-14 07:06:04,510 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-14 07:06:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 246 transitions. [2022-07-14 07:06:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 07:06:04,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:04,525 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-14 07:06:04,721 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-14 07:06:04,721 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:04,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:04,722 INFO L85 PathProgramCache]: Analyzing trace with hash 364909914, now seen corresponding path program 1 times [2022-07-14 07:06:04,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:04,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854318301] [2022-07-14 07:06:04,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:04,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:04,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:04,724 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-14 07:06:04,728 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-14 07:06:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:04,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 07:06:04,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:04,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:04,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:04,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854318301] [2022-07-14 07:06:04,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854318301] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:04,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:04,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 07:06:04,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152681481] [2022-07-14 07:06:04,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:04,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 07:06:04,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:04,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 07:06:04,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-14 07:06:04,927 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-14 07:06:05,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:05,130 INFO L93 Difference]: Finished difference Result 232 states and 299 transitions. [2022-07-14 07:06:05,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 07:06:05,131 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-14 07:06:05,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:05,132 INFO L225 Difference]: With dead ends: 232 [2022-07-14 07:06:05,132 INFO L226 Difference]: Without dead ends: 221 [2022-07-14 07:06:05,132 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-14 07:06:05,133 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 135 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:05,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1682 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 07:06:05,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-14 07:06:05,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 190. [2022-07-14 07:06:05,137 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-14 07:06:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 249 transitions. [2022-07-14 07:06:05,138 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 249 transitions. Word has length 49 [2022-07-14 07:06:05,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:05,138 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 249 transitions. [2022-07-14 07:06:05,139 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-14 07:06:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 249 transitions. [2022-07-14 07:06:05,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 07:06:05,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:05,140 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-14 07:06:05,151 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-14 07:06:05,340 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-14 07:06:05,340 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:05,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:05,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1169166180, now seen corresponding path program 1 times [2022-07-14 07:06:05,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:05,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49856727] [2022-07-14 07:06:05,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:05,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:05,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:05,343 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-14 07:06:05,345 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-14 07:06:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:05,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 07:06:05,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:05,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-14 07:06:05,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:05,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:05,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49856727] [2022-07-14 07:06:05,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49856727] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:05,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:05,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 07:06:05,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797103688] [2022-07-14 07:06:05,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:05,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 07:06:05,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:05,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 07:06:05,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 07:06:05,569 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-14 07:06:05,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:05,648 INFO L93 Difference]: Finished difference Result 190 states and 247 transitions. [2022-07-14 07:06:05,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 07:06:05,648 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-14 07:06:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:05,649 INFO L225 Difference]: With dead ends: 190 [2022-07-14 07:06:05,649 INFO L226 Difference]: Without dead ends: 190 [2022-07-14 07:06:05,650 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-14 07:06:05,650 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-14 07:06:05,651 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-14 07:06:05,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-14 07:06:05,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-07-14 07:06:05,655 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-14 07:06:05,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2022-07-14 07:06:05,656 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 45 [2022-07-14 07:06:05,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:05,657 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2022-07-14 07:06:05,657 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-14 07:06:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2022-07-14 07:06:05,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 07:06:05,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:05,658 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-14 07:06:05,669 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-14 07:06:05,868 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-14 07:06:05,868 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:05,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:05,869 INFO L85 PathProgramCache]: Analyzing trace with hash -648920610, now seen corresponding path program 1 times [2022-07-14 07:06:05,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:05,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102406829] [2022-07-14 07:06:05,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:05,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:05,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:05,870 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-14 07:06:05,871 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-14 07:06:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:05,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 07:06:05,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:06,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:06,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:06,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:06,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102406829] [2022-07-14 07:06:06,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102406829] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:06,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:06,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 07:06:06,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536865990] [2022-07-14 07:06:06,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:06,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 07:06:06,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:06,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 07:06:06,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 07:06:06,048 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-14 07:06:06,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:06,193 INFO L93 Difference]: Finished difference Result 214 states and 274 transitions. [2022-07-14 07:06:06,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 07:06:06,194 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-14 07:06:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:06,196 INFO L225 Difference]: With dead ends: 214 [2022-07-14 07:06:06,196 INFO L226 Difference]: Without dead ends: 202 [2022-07-14 07:06:06,196 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-14 07:06:06,196 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-14 07:06:06,196 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-14 07:06:06,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-14 07:06:06,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 196. [2022-07-14 07:06:06,200 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-14 07:06:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 255 transitions. [2022-07-14 07:06:06,201 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 255 transitions. Word has length 43 [2022-07-14 07:06:06,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:06,201 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 255 transitions. [2022-07-14 07:06:06,201 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-14 07:06:06,202 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 255 transitions. [2022-07-14 07:06:06,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 07:06:06,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:06,202 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-14 07:06:06,210 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-14 07:06:06,403 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-14 07:06:06,403 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:06,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:06,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1043867234, now seen corresponding path program 1 times [2022-07-14 07:06:06,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:06,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310213771] [2022-07-14 07:06:06,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:06,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:06,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:06,405 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-14 07:06:06,406 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-14 07:06:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:06,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 07:06:06,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:06,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-14 07:06:06,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:06,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:06,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310213771] [2022-07-14 07:06:06,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310213771] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:06,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:06,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 07:06:06,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585955908] [2022-07-14 07:06:06,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:06,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 07:06:06,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:06,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 07:06:06,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 07:06:06,573 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-14 07:06:06,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:06,709 INFO L93 Difference]: Finished difference Result 207 states and 265 transitions. [2022-07-14 07:06:06,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 07:06:06,710 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-14 07:06:06,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:06,711 INFO L225 Difference]: With dead ends: 207 [2022-07-14 07:06:06,711 INFO L226 Difference]: Without dead ends: 191 [2022-07-14 07:06:06,712 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-14 07:06:06,712 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-14 07:06:06,712 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-14 07:06:06,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-14 07:06:06,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2022-07-14 07:06:06,716 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-14 07:06:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 239 transitions. [2022-07-14 07:06:06,717 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 239 transitions. Word has length 43 [2022-07-14 07:06:06,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:06,717 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 239 transitions. [2022-07-14 07:06:06,717 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-14 07:06:06,717 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 239 transitions. [2022-07-14 07:06:06,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 07:06:06,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:06,718 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-14 07:06:06,728 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-14 07:06:06,927 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-14 07:06:06,928 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:06,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:06,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1608018874, now seen corresponding path program 1 times [2022-07-14 07:06:06,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:06,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980658207] [2022-07-14 07:06:06,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:06,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:06,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:06,929 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-14 07:06:06,930 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-14 07:06:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:06,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 07:06:06,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:07,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:07,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:07,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980658207] [2022-07-14 07:06:07,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980658207] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:07,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:07,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 07:06:07,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233641265] [2022-07-14 07:06:07,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:07,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 07:06:07,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:07,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 07:06:07,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 07:06:07,097 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-14 07:06:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:07,278 INFO L93 Difference]: Finished difference Result 210 states and 265 transitions. [2022-07-14 07:06:07,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 07:06:07,278 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-14 07:06:07,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:07,279 INFO L225 Difference]: With dead ends: 210 [2022-07-14 07:06:07,279 INFO L226 Difference]: Without dead ends: 198 [2022-07-14 07:06:07,280 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-14 07:06:07,280 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-14 07:06:07,280 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-14 07:06:07,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-14 07:06:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 185. [2022-07-14 07:06:07,284 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-14 07:06:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 238 transitions. [2022-07-14 07:06:07,285 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 238 transitions. Word has length 43 [2022-07-14 07:06:07,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:07,285 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 238 transitions. [2022-07-14 07:06:07,285 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-14 07:06:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 238 transitions. [2022-07-14 07:06:07,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 07:06:07,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:07,286 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-14 07:06:07,298 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-14 07:06:07,496 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-14 07:06:07,496 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:07,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:07,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1614034079, now seen corresponding path program 1 times [2022-07-14 07:06:07,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:07,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916980755] [2022-07-14 07:06:07,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:07,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:07,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:07,499 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-14 07:06:07,501 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-14 07:06:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:07,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 07:06:07,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:07,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:07,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:07,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916980755] [2022-07-14 07:06:07,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916980755] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:07,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:07,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 07:06:07,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738806279] [2022-07-14 07:06:07,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:07,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 07:06:07,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:07,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 07:06:07,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-14 07:06:07,705 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-14 07:06:07,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:07,842 INFO L93 Difference]: Finished difference Result 211 states and 267 transitions. [2022-07-14 07:06:07,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 07:06:07,843 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-14 07:06:07,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:07,844 INFO L225 Difference]: With dead ends: 211 [2022-07-14 07:06:07,844 INFO L226 Difference]: Without dead ends: 200 [2022-07-14 07:06:07,844 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-14 07:06:07,844 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 19 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:07,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1632 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:06:07,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-14 07:06:07,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 191. [2022-07-14 07:06:07,848 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-14 07:06:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 246 transitions. [2022-07-14 07:06:07,849 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 246 transitions. Word has length 50 [2022-07-14 07:06:07,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:07,850 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 246 transitions. [2022-07-14 07:06:07,850 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-14 07:06:07,850 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 246 transitions. [2022-07-14 07:06:07,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 07:06:07,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:07,851 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-14 07:06:07,862 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-14 07:06:08,060 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-14 07:06:08,060 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:08,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:08,061 INFO L85 PathProgramCache]: Analyzing trace with hash 27450463, now seen corresponding path program 1 times [2022-07-14 07:06:08,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:08,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411375395] [2022-07-14 07:06:08,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:08,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:08,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:08,062 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-14 07:06:08,063 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-14 07:06:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:08,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 07:06:08,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:06:08,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:08,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:08,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411375395] [2022-07-14 07:06:08,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411375395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:08,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:08,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 07:06:08,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089503189] [2022-07-14 07:06:08,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:08,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 07:06:08,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:08,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 07:06:08,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-14 07:06:08,263 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-14 07:06:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:08,403 INFO L93 Difference]: Finished difference Result 200 states and 255 transitions. [2022-07-14 07:06:08,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 07:06:08,404 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-14 07:06:08,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:08,405 INFO L225 Difference]: With dead ends: 200 [2022-07-14 07:06:08,405 INFO L226 Difference]: Without dead ends: 167 [2022-07-14 07:06:08,405 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-14 07:06:08,406 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-14 07:06:08,406 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-14 07:06:08,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-14 07:06:08,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2022-07-14 07:06:08,409 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-14 07:06:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 198 transitions. [2022-07-14 07:06:08,410 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 198 transitions. Word has length 50 [2022-07-14 07:06:08,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:08,410 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 198 transitions. [2022-07-14 07:06:08,410 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-14 07:06:08,410 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 198 transitions. [2022-07-14 07:06:08,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 07:06:08,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:08,410 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-14 07:06:08,421 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-14 07:06:08,611 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-14 07:06:08,611 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:08,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:08,612 INFO L85 PathProgramCache]: Analyzing trace with hash -825515977, now seen corresponding path program 1 times [2022-07-14 07:06:08,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:08,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729388875] [2022-07-14 07:06:08,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:08,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:08,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:08,613 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-14 07:06:08,614 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-14 07:06:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 07:06:08,678 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 07:06:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 07:06:08,766 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-14 07:06:08,766 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 07:06:08,767 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-07-14 07:06:08,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-07-14 07:06:08,778 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-14 07:06:08,978 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-14 07:06:08,981 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-14 07:06:08,984 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 07:06:09,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 07:06:09 BoogieIcfgContainer [2022-07-14 07:06:09,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 07:06:09,087 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 07:06:09,087 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 07:06:09,087 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 07:06:09,087 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:05:55" (3/4) ... [2022-07-14 07:06:09,089 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 07:06:09,089 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 07:06:09,090 INFO L158 Benchmark]: Toolchain (without parser) took 15045.55ms. Allocated memory was 54.5MB in the beginning and 107.0MB in the end (delta: 52.4MB). Free memory was 32.3MB in the beginning and 81.4MB in the end (delta: -49.1MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2022-07-14 07:06:09,090 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 07:06:09,090 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.02ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 32.1MB in the beginning and 43.3MB in the end (delta: -11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-14 07:06:09,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.42ms. Allocated memory is still 67.1MB. Free memory was 43.3MB in the beginning and 40.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-14 07:06:09,091 INFO L158 Benchmark]: Boogie Preprocessor took 39.25ms. Allocated memory is still 67.1MB. Free memory was 39.8MB in the beginning and 37.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 07:06:09,091 INFO L158 Benchmark]: RCFGBuilder took 896.96ms. Allocated memory is still 67.1MB. Free memory was 37.2MB in the beginning and 35.3MB in the end (delta: 1.8MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2022-07-14 07:06:09,091 INFO L158 Benchmark]: TraceAbstraction took 13627.82ms. Allocated memory was 67.1MB in the beginning and 107.0MB in the end (delta: 39.8MB). Free memory was 34.9MB in the beginning and 81.4MB in the end (delta: -46.6MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. [2022-07-14 07:06:09,092 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 107.0MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 07:06:09,093 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.14ms. Allocated memory is still 54.5MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.02ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 32.1MB in the beginning and 43.3MB in the end (delta: -11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.42ms. Allocated memory is still 67.1MB. Free memory was 43.3MB in the beginning and 40.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.25ms. Allocated memory is still 67.1MB. Free memory was 39.8MB in the beginning and 37.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 896.96ms. Allocated memory is still 67.1MB. Free memory was 37.2MB in the beginning and 35.3MB in the end (delta: 1.8MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13627.82ms. Allocated memory was 67.1MB in the beginning and 107.0MB in the end (delta: 39.8MB). Free memory was 34.9MB in the beginning and 81.4MB in the end (delta: -46.6MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 107.0MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1013]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1013. Possible FailurePath: [L23] int KernelMode ; [L24] int Executive ; [L25] int DevicePowerState ; [L26] int s ; [L27] int UNLOADED ; [L28] int NP ; [L29] int DC ; [L30] int SKIP1 ; [L31] int SKIP2 ; [L32] int MPR1 ; [L33] int MPR3 ; [L34] int IPC ; [L35] int pended ; [L36] int compFptr ; [L37] int compRegistered ; [L38] int lowerDriverReturn ; [L39] int setEventCalled ; [L40] int customIrp ; [L41] int myStatus ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, UNLOADED=0] [L294] int status ; [L295] int irp = __VERIFIER_nondet_int() ; [L296] int pirp ; [L297] int pirp__IoStatus__Status ; [L298] int irp_choice = __VERIFIER_nondet_int() ; [L299] int devobj = __VERIFIER_nondet_int() ; [L300] int __cil_tmp8 ; [L302] KernelMode = 0 [L303] Executive = 0 [L304] DevicePowerState = 1 [L305] s = 0 [L306] UNLOADED = 0 [L307] NP = 0 [L308] DC = 0 [L309] SKIP1 = 0 [L310] SKIP2 = 0 [L311] MPR1 = 0 [L312] MPR3 = 0 [L313] IPC = 0 [L314] pended = 0 [L315] compFptr = 0 [L316] compRegistered = 0 [L317] lowerDriverReturn = 0 [L318] setEventCalled = 0 [L319] customIrp = 0 [L320] myStatus = 0 [L324] status = 0 [L325] pirp = irp [L326] CALL _BLAST_init() [L61] UNLOADED = 0 [L62] NP = 1 [L63] DC = 2 [L64] SKIP1 = 3 [L65] SKIP2 = 4 [L66] MPR1 = 5 [L67] MPR3 = 6 [L68] IPC = 7 [L69] s = UNLOADED [L70] pended = 0 [L71] compFptr = 0 [L72] compRegistered = 0 [L73] lowerDriverReturn = 0 [L74] setEventCalled = 0 [L75] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L326] RET _BLAST_init() [L328] COND TRUE status >= 0 [L329] s = NP [L330] customIrp = 0 [L331] setEventCalled = customIrp [L332] lowerDriverReturn = setEventCalled [L333] compRegistered = lowerDriverReturn [L334] pended = compRegistered [L335] pirp__IoStatus__Status = 0 [L336] myStatus = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, irp=9, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L337] COND TRUE irp_choice == 0 [L338] pirp__IoStatus__Status = -1073741637 [L339] myStatus = -1073741637 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, irp=9, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=3221225659, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L342] CALL stub_driver_init() [L47] s = NP [L48] pended = 0 [L49] compFptr = 0 [L50] compRegistered = 0 [L51] lowerDriverReturn = 0 [L52] setEventCalled = 0 [L53] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L342] RET stub_driver_init() [L345] COND FALSE !(status < 0) [L349] int tmp_ndt_1; [L350] tmp_ndt_1 = __VERIFIER_nondet_int() [L351] COND FALSE !(tmp_ndt_1 == 0) [L354] int tmp_ndt_2; [L355] tmp_ndt_2 = __VERIFIER_nondet_int() [L356] COND FALSE !(tmp_ndt_2 == 1) [L359] int tmp_ndt_3; [L360] tmp_ndt_3 = __VERIFIER_nondet_int() [L361] COND TRUE tmp_ndt_3 == 3 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, irp=9, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=3221225659, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=2147483648, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L388] CALL, EXPR KbFilter_PnP(devobj, pirp) [L80] int devExt ; [L81] int irpStack ; [L82] int status ; [L83] int event = __VERIFIER_nondet_int() ; [L84] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L85] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L86] int irpStack__MinorFunction = __VERIFIER_nondet_int() ; [L87] int devExt__TopOfStack = __VERIFIER_nondet_int() ; [L88] int devExt__Started ; [L89] int devExt__Removed ; [L90] int devExt__SurpriseRemoved ; [L91] int Irp__IoStatus__Status ; [L92] int Irp__IoStatus__Information ; [L93] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L94] int irpSp ; [L95] int nextIrpSp ; [L96] int nextIrpSp__Control ; [L97] int irpSp___0 ; [L98] int irpSp__Context ; [L99] int irpSp__Control ; [L100] long __cil_tmp23 ; [L103] status = 0 [L104] devExt = DeviceObject__DeviceExtension [L105] irpStack = Irp__Tail__Overlay__CurrentStackLocation VAL [\old(DeviceObject)=8, \old(Irp)=9, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=10, DeviceObject=8, DeviceObject__DeviceExtension=10, DevicePowerState=1, Executive=0, IPC=7, Irp=9, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L106] COND FALSE !(irpStack__MinorFunction == 0) VAL [\old(DeviceObject)=8, \old(Irp)=9, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=10, DeviceObject=8, DeviceObject__DeviceExtension=10, DevicePowerState=1, Executive=0, IPC=7, Irp=9, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L109] COND FALSE !(irpStack__MinorFunction == 23) VAL [\old(DeviceObject)=8, \old(Irp)=9, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=10, DeviceObject=8, DeviceObject__DeviceExtension=10, DevicePowerState=1, Executive=0, IPC=7, Irp=9, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L112] COND TRUE irpStack__MinorFunction == 2 VAL [\old(DeviceObject)=8, \old(Irp)=9, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=10, DeviceObject=8, DeviceObject__DeviceExtension=10, DevicePowerState=1, Executive=0, IPC=7, Irp=9, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L236] devExt__Removed = 1 VAL [\old(DeviceObject)=8, \old(Irp)=9, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=10, devExt__Removed=1, DeviceObject=8, DeviceObject__DeviceExtension=10, DevicePowerState=1, Executive=0, IPC=7, Irp=9, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L237] COND TRUE s == NP [L238] s = SKIP1 VAL [\old(DeviceObject)=8, \old(Irp)=9, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=10, devExt__Removed=1, DeviceObject=8, DeviceObject__DeviceExtension=10, DevicePowerState=1, Executive=0, IPC=7, Irp=9, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L245] Irp__CurrentLocation ++ [L246] Irp__Tail__Overlay__CurrentStackLocation ++ VAL [\old(DeviceObject)=8, \old(Irp)=9, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=10, devExt__Removed=1, DeviceObject=8, DeviceObject__DeviceExtension=10, DevicePowerState=1, Executive=0, IPC=7, Irp=9, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L247] CALL IofCallDriver(devExt__TopOfStack, Irp) VAL [\old(DeviceObject)=11, \old(Irp)=9, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L483] int returnVal2 ; [L484] int compRetStatus ; [L485] int lcontext = __VERIFIER_nondet_int() ; [L486] long long __cil_tmp7 ; VAL [\old(DeviceObject)=11, \old(Irp)=9, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=11, DevicePowerState=1, Executive=0, IPC=7, Irp=9, KernelMode=0, lcontext=13, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L489] COND FALSE !(\read(compRegistered)) VAL [\old(DeviceObject)=11, \old(Irp)=9, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=11, DevicePowerState=1, Executive=0, IPC=7, Irp=9, KernelMode=0, lcontext=13, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L502] int tmp_ndt_6; [L503] tmp_ndt_6 = __VERIFIER_nondet_int() [L504] COND FALSE !(tmp_ndt_6 == 0) [L507] int tmp_ndt_7; [L508] tmp_ndt_7 = __VERIFIER_nondet_int() [L509] COND TRUE tmp_ndt_7 == 1 VAL [\old(DeviceObject)=11, \old(Irp)=9, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=11, DevicePowerState=1, Executive=0, IPC=7, Irp=9, KernelMode=0, lcontext=13, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=2147483648, tmp_ndt_7=1, UNLOADED=0] [L518] returnVal2 = -1073741823 VAL [\old(DeviceObject)=11, \old(Irp)=9, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=11, DevicePowerState=1, Executive=0, IPC=7, Irp=9, KernelMode=0, lcontext=13, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, returnVal2=3221225473, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=2147483648, tmp_ndt_7=1, UNLOADED=0] [L528] COND FALSE !(s == NP) VAL [\old(DeviceObject)=11, \old(Irp)=9, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=11, DevicePowerState=1, Executive=0, IPC=7, Irp=9, KernelMode=0, lcontext=13, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, returnVal2=3221225473, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=2147483648, tmp_ndt_7=1, UNLOADED=0] [L532] COND FALSE !(s == MPR1) VAL [\old(DeviceObject)=11, \old(Irp)=9, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=11, DevicePowerState=1, Executive=0, IPC=7, Irp=9, KernelMode=0, lcontext=13, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, returnVal2=3221225473, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=2147483648, tmp_ndt_7=1, UNLOADED=0] [L541] COND TRUE s == SKIP1 [L542] s = SKIP2 [L543] lowerDriverReturn = returnVal2 VAL [\old(DeviceObject)=11, \old(Irp)=9, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=11, DevicePowerState=1, Executive=0, IPC=7, Irp=9, KernelMode=0, lcontext=13, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, returnVal2=3221225473, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=2147483648, tmp_ndt_7=1, UNLOADED=0] [L551] return (returnVal2); VAL [\old(DeviceObject)=11, \old(Irp)=9, \old(lowerDriverReturn)=0, \old(s)=3, \old(setEventCalled)=0, \result=-1073741823, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=11, DevicePowerState=1, Executive=0, IPC=7, Irp=9, KernelMode=0, lcontext=13, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, returnVal2=3221225473, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=2147483648, tmp_ndt_7=1, UNLOADED=0] [L247] RET IofCallDriver(devExt__TopOfStack, Irp) VAL [\old(DeviceObject)=8, \old(Irp)=9, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=10, devExt__Removed=1, devExt__TopOfStack=11, DeviceObject=8, DeviceObject__DeviceExtension=10, DevicePowerState=1, Executive=0, IofCallDriver(devExt__TopOfStack, Irp)=-1073741823, IPC=7, Irp=9, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L248] status = 0 VAL [\old(DeviceObject)=8, \old(Irp)=9, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=10, devExt__Removed=1, devExt__TopOfStack=11, DeviceObject=8, DeviceObject__DeviceExtension=10, DevicePowerState=1, Executive=0, IPC=7, Irp=9, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L290] return (status); VAL [\old(DeviceObject)=8, \old(Irp)=9, \result=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=10, devExt__Removed=1, devExt__TopOfStack=11, DeviceObject=8, DeviceObject__DeviceExtension=10, DevicePowerState=1, Executive=0, IPC=7, Irp=9, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L388] RET, EXPR KbFilter_PnP(devobj, pirp) [L388] status = KbFilter_PnP(devobj, pirp) [L412] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=8, Executive=0, IPC=7, irp=9, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=2147483648, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L420] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=8, Executive=0, IPC=7, irp=9, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=2147483648, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L428] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=8, Executive=0, IPC=7, irp=9, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=2147483648, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L429] COND TRUE status != -1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=8, Executive=0, IPC=7, irp=9, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=2147483648, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L430] COND FALSE !(s != SKIP2) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=8, Executive=0, IPC=7, irp=9, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=2147483648, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L440] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=8, Executive=0, IPC=7, irp=9, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=2147483648, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L447] COND FALSE !(s == DC) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=8, Executive=0, IPC=7, irp=9, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=2147483648, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L452] COND TRUE status != lowerDriverReturn VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=8, Executive=0, IPC=7, irp=9, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=9, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=2147483648, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L453] CALL errorFn() VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L1013] reach_error() VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] - UnprovableResult [Line: 293]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 210 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3760 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3736 mSDsluCounter, 21777 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15453 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2306 IncrementalHoareTripleChecker+Invalid, 2483 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 6324 mSDtfsCounter, 2306 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.9s 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.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.1s 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-14 07:06:09,150 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