./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 eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-eb692b5 [2022-07-20 06:32:43,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:32:43,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:32:43,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:32:43,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:32:43,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:32:43,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:32:43,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:32:43,929 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:32:43,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:32:43,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:32:43,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:32:43,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:32:43,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:32:43,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:32:43,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:32:43,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:32:43,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:32:43,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:32:43,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:32:43,952 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:32:43,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:32:43,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:32:43,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:32:43,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:32:43,962 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:32:43,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:32:43,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:32:43,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:32:43,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:32:43,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:32:43,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:32:43,967 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:32:43,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:32:43,968 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:32:43,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:32:43,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:32:43,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:32:43,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:32:43,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:32:43,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:32:43,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:32:43,974 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 06:32:44,002 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:32:44,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:32:44,004 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:32:44,005 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:32:44,005 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:32:44,006 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:32:44,006 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:32:44,006 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:32:44,006 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:32:44,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:32:44,008 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:32:44,008 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:32:44,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:32:44,008 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:32:44,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:32:44,008 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:32:44,009 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:32:44,009 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:32:44,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:32:44,010 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:32:44,010 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:32:44,011 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:32:44,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:32:44,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:32:44,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:32:44,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:32:44,012 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:32:44,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:32:44,012 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 06:32:44,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 06:32:44,013 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-20 06:32:44,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:32:44,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:32:44,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:32:44,293 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:32:44,293 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:32:44,294 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-20 06:32:44,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f1501ace/50233b857f164b1b9919858ecf713969/FLAGa1255c71e [2022-07-20 06:32:44,840 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:32:44,840 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2022-07-20 06:32:44,850 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f1501ace/50233b857f164b1b9919858ecf713969/FLAGa1255c71e [2022-07-20 06:32:45,221 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f1501ace/50233b857f164b1b9919858ecf713969 [2022-07-20 06:32:45,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:32:45,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:32:45,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:32:45,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:32:45,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:32:45,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:32:45" (1/1) ... [2022-07-20 06:32:45,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd2d0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:45, skipping insertion in model container [2022-07-20 06:32:45,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:32:45" (1/1) ... [2022-07-20 06:32:45,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:32:45,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:32:45,578 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-20 06:32:45,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:32:45,594 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:32:45,651 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-20 06:32:45,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:32:45,667 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:32:45,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:45 WrapperNode [2022-07-20 06:32:45,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:32:45,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:32:45,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:32:45,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:32:45,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:45" (1/1) ... [2022-07-20 06:32:45,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:45" (1/1) ... [2022-07-20 06:32:45,749 INFO L137 Inliner]: procedures = 29, calls = 44, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 663 [2022-07-20 06:32:45,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:32:45,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:32:45,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:32:45,757 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:32:45,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:45" (1/1) ... [2022-07-20 06:32:45,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:45" (1/1) ... [2022-07-20 06:32:45,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:45" (1/1) ... [2022-07-20 06:32:45,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:45" (1/1) ... [2022-07-20 06:32:45,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:45" (1/1) ... [2022-07-20 06:32:45,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:45" (1/1) ... [2022-07-20 06:32:45,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:45" (1/1) ... [2022-07-20 06:32:45,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:32:45,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:32:45,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:32:45,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:32:45,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:45" (1/1) ... [2022-07-20 06:32:45,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:32:45,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:32:45,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 06:32:45,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 06:32:45,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:32:45,850 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-07-20 06:32:45,850 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-07-20 06:32:45,850 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-20 06:32:45,851 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-20 06:32:45,851 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-07-20 06:32:45,851 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-07-20 06:32:45,851 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-20 06:32:45,851 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-20 06:32:45,851 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-20 06:32:45,852 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-20 06:32:45,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 06:32:45,852 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-20 06:32:45,852 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-20 06:32:45,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:32:45,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:32:45,852 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-07-20 06:32:45,853 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-07-20 06:32:46,017 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:32:46,018 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:32:46,117 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 06:32:46,121 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 06:32:46,123 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 06:32:46,127 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 06:32:46,129 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 06:32:46,483 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume !false; [2022-07-20 06:32:46,483 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume false; [2022-07-20 06:32:46,483 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##63: assume !false; [2022-07-20 06:32:46,483 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume false; [2022-07-20 06:32:46,484 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume false; [2022-07-20 06:32:46,484 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !false; [2022-07-20 06:32:46,484 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-07-20 06:32:46,484 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-07-20 06:32:46,484 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume !false; [2022-07-20 06:32:46,484 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume false; [2022-07-20 06:32:46,503 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 06:32:46,534 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-07-20 06:32:46,535 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-07-20 06:32:46,548 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:32:46,558 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:32:46,561 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 06:32:46,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:32:46 BoogieIcfgContainer [2022-07-20 06:32:46,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:32:46,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:32:46,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:32:46,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:32:46,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:32:45" (1/3) ... [2022-07-20 06:32:46,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b667756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:32:46, skipping insertion in model container [2022-07-20 06:32:46,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:45" (2/3) ... [2022-07-20 06:32:46,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b667756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:32:46, skipping insertion in model container [2022-07-20 06:32:46,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:32:46" (3/3) ... [2022-07-20 06:32:46,574 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2022-07-20 06:32:46,591 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:32:46,591 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-20 06:32:46,645 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:32:46,664 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@7f38b16c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3c4aa5c9 [2022-07-20 06:32:46,664 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-20 06:32:46,680 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-20 06:32:46,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 06:32:46,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:46,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:32:46,709 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:46,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:46,718 INFO L85 PathProgramCache]: Analyzing trace with hash -15799092, now seen corresponding path program 1 times [2022-07-20 06:32:46,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:46,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731625106] [2022-07-20 06:32:46,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:46,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:46,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:46,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:46,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731625106] [2022-07-20 06:32:46,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731625106] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:46,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:46,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:32:46,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152245657] [2022-07-20 06:32:46,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:46,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:32:46,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:46,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:32:46,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:32:46,935 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-20 06:32:47,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:47,003 INFO L93 Difference]: Finished difference Result 212 states and 315 transitions. [2022-07-20 06:32:47,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:32:47,006 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-20 06:32:47,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:47,020 INFO L225 Difference]: With dead ends: 212 [2022-07-20 06:32:47,022 INFO L226 Difference]: Without dead ends: 208 [2022-07-20 06:32:47,023 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-20 06:32:47,026 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-20 06:32:47,028 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-20 06:32:47,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-20 06:32:47,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2022-07-20 06:32:47,084 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-20 06:32:47,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 310 transitions. [2022-07-20 06:32:47,089 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 310 transitions. Word has length 8 [2022-07-20 06:32:47,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:47,089 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 310 transitions. [2022-07-20 06:32:47,090 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-20 06:32:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 310 transitions. [2022-07-20 06:32:47,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 06:32:47,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:47,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:32:47,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 06:32:47,091 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:47,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:47,092 INFO L85 PathProgramCache]: Analyzing trace with hash -191249986, now seen corresponding path program 1 times [2022-07-20 06:32:47,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:47,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41465993] [2022-07-20 06:32:47,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:47,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:47,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:47,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:47,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41465993] [2022-07-20 06:32:47,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41465993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:47,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:47,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:32:47,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573206095] [2022-07-20 06:32:47,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:47,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:32:47,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:47,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:32:47,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:32:47,152 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-20 06:32:47,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:47,190 INFO L93 Difference]: Finished difference Result 205 states and 309 transitions. [2022-07-20 06:32:47,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:32:47,191 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-20 06:32:47,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:47,193 INFO L225 Difference]: With dead ends: 205 [2022-07-20 06:32:47,193 INFO L226 Difference]: Without dead ends: 201 [2022-07-20 06:32:47,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:32:47,194 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-20 06:32:47,195 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-20 06:32:47,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-20 06:32:47,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-07-20 06:32:47,206 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-20 06:32:47,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 296 transitions. [2022-07-20 06:32:47,209 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 296 transitions. Word has length 15 [2022-07-20 06:32:47,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:47,210 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 296 transitions. [2022-07-20 06:32:47,210 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-20 06:32:47,210 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 296 transitions. [2022-07-20 06:32:47,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 06:32:47,211 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:47,211 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-20 06:32:47,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 06:32:47,212 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:47,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:47,212 INFO L85 PathProgramCache]: Analyzing trace with hash 509601447, now seen corresponding path program 1 times [2022-07-20 06:32:47,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:47,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260637623] [2022-07-20 06:32:47,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:47,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:47,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:47,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260637623] [2022-07-20 06:32:47,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260637623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:47,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:47,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:32:47,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172786025] [2022-07-20 06:32:47,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:47,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:32:47,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:47,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:32:47,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:32:47,316 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-20 06:32:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:47,417 INFO L93 Difference]: Finished difference Result 269 states and 381 transitions. [2022-07-20 06:32:47,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:32:47,418 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-20 06:32:47,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:47,420 INFO L225 Difference]: With dead ends: 269 [2022-07-20 06:32:47,420 INFO L226 Difference]: Without dead ends: 268 [2022-07-20 06:32:47,420 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-20 06:32:47,422 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 205 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:32:47,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 438 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:32:47,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-20 06:32:47,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 252. [2022-07-20 06:32:47,437 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-20 06:32:47,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 361 transitions. [2022-07-20 06:32:47,440 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 361 transitions. Word has length 19 [2022-07-20 06:32:47,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:47,440 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 361 transitions. [2022-07-20 06:32:47,440 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-20 06:32:47,441 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 361 transitions. [2022-07-20 06:32:47,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 06:32:47,442 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:47,442 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-20 06:32:47,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 06:32:47,442 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:47,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:47,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2016043468, now seen corresponding path program 1 times [2022-07-20 06:32:47,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:47,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415342582] [2022-07-20 06:32:47,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:47,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:47,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:47,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415342582] [2022-07-20 06:32:47,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415342582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:47,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:47,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:32:47,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959762201] [2022-07-20 06:32:47,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:47,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:32:47,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:47,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:32:47,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:32:47,537 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-20 06:32:47,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:47,559 INFO L93 Difference]: Finished difference Result 312 states and 436 transitions. [2022-07-20 06:32:47,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:32:47,560 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-20 06:32:47,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:47,562 INFO L225 Difference]: With dead ends: 312 [2022-07-20 06:32:47,562 INFO L226 Difference]: Without dead ends: 312 [2022-07-20 06:32:47,563 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-20 06:32:47,573 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-20 06:32:47,574 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-20 06:32:47,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-20 06:32:47,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 290. [2022-07-20 06:32:47,590 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-20 06:32:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 410 transitions. [2022-07-20 06:32:47,591 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 410 transitions. Word has length 18 [2022-07-20 06:32:47,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:47,592 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 410 transitions. [2022-07-20 06:32:47,592 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-20 06:32:47,592 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 410 transitions. [2022-07-20 06:32:47,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:32:47,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:47,594 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-20 06:32:47,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 06:32:47,595 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:47,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:47,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1363549369, now seen corresponding path program 1 times [2022-07-20 06:32:47,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:47,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429716584] [2022-07-20 06:32:47,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:47,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:47,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:47,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429716584] [2022-07-20 06:32:47,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429716584] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:47,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:47,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:32:47,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463714868] [2022-07-20 06:32:47,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:47,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:32:47,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:47,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:32:47,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:32:47,663 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-20 06:32:47,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:47,723 INFO L93 Difference]: Finished difference Result 289 states and 407 transitions. [2022-07-20 06:32:47,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:32:47,724 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-20 06:32:47,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:47,730 INFO L225 Difference]: With dead ends: 289 [2022-07-20 06:32:47,730 INFO L226 Difference]: Without dead ends: 289 [2022-07-20 06:32:47,730 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-20 06:32:47,734 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-20 06:32:47,735 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-20 06:32:47,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-20 06:32:47,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2022-07-20 06:32:47,753 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-20 06:32:47,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 407 transitions. [2022-07-20 06:32:47,756 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 407 transitions. Word has length 29 [2022-07-20 06:32:47,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:47,756 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 407 transitions. [2022-07-20 06:32:47,756 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-20 06:32:47,757 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 407 transitions. [2022-07-20 06:32:47,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 06:32:47,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:47,759 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-20 06:32:47,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 06:32:47,760 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:47,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:47,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1270637010, now seen corresponding path program 1 times [2022-07-20 06:32:47,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:47,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313384413] [2022-07-20 06:32:47,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:47,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:47,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 06:32:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:47,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:47,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313384413] [2022-07-20 06:32:47,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313384413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:47,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:47,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:32:47,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803087778] [2022-07-20 06:32:47,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:47,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:32:47,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:47,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:32:47,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:32:47,888 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-20 06:32:48,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:48,095 INFO L93 Difference]: Finished difference Result 307 states and 427 transitions. [2022-07-20 06:32:48,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:32:48,096 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-20 06:32:48,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:48,098 INFO L225 Difference]: With dead ends: 307 [2022-07-20 06:32:48,098 INFO L226 Difference]: Without dead ends: 306 [2022-07-20 06:32:48,098 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-20 06:32:48,099 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-20 06:32:48,099 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-20 06:32:48,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-20 06:32:48,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2022-07-20 06:32:48,113 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-20 06:32:48,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 422 transitions. [2022-07-20 06:32:48,114 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 422 transitions. Word has length 33 [2022-07-20 06:32:48,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:48,115 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 422 transitions. [2022-07-20 06:32:48,115 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-20 06:32:48,115 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 422 transitions. [2022-07-20 06:32:48,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:32:48,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:48,117 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-20 06:32:48,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 06:32:48,117 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:48,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:48,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1113906492, now seen corresponding path program 1 times [2022-07-20 06:32:48,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:48,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297479264] [2022-07-20 06:32:48,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:48,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:48,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 06:32:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:48,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:48,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297479264] [2022-07-20 06:32:48,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297479264] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:48,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:48,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:32:48,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437552828] [2022-07-20 06:32:48,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:48,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:32:48,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:48,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:32:48,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:32:48,214 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-20 06:32:48,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:48,378 INFO L93 Difference]: Finished difference Result 306 states and 425 transitions. [2022-07-20 06:32:48,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:32:48,379 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-20 06:32:48,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:48,383 INFO L225 Difference]: With dead ends: 306 [2022-07-20 06:32:48,383 INFO L226 Difference]: Without dead ends: 306 [2022-07-20 06:32:48,384 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-20 06:32:48,385 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 331 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:32:48,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 632 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:32:48,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-20 06:32:48,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2022-07-20 06:32:48,395 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-20 06:32:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 421 transitions. [2022-07-20 06:32:48,397 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 421 transitions. Word has length 34 [2022-07-20 06:32:48,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:48,398 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 421 transitions. [2022-07-20 06:32:48,398 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-20 06:32:48,398 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 421 transitions. [2022-07-20 06:32:48,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:32:48,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:48,402 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-20 06:32:48,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 06:32:48,402 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:48,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:48,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2136327390, now seen corresponding path program 1 times [2022-07-20 06:32:48,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:48,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030031282] [2022-07-20 06:32:48,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:48,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:48,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 06:32:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:48,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:48,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030031282] [2022-07-20 06:32:48,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030031282] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:48,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:48,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:32:48,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438362631] [2022-07-20 06:32:48,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:48,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:32:48,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:48,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:32:48,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:32:48,485 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-20 06:32:48,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:48,617 INFO L93 Difference]: Finished difference Result 282 states and 385 transitions. [2022-07-20 06:32:48,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:32:48,618 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-20 06:32:48,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:48,620 INFO L225 Difference]: With dead ends: 282 [2022-07-20 06:32:48,620 INFO L226 Difference]: Without dead ends: 282 [2022-07-20 06:32:48,621 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-20 06:32:48,621 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-20 06:32:48,622 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-20 06:32:48,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-20 06:32:48,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 268. [2022-07-20 06:32:48,629 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-20 06:32:48,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 370 transitions. [2022-07-20 06:32:48,632 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 370 transitions. Word has length 34 [2022-07-20 06:32:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:48,632 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 370 transitions. [2022-07-20 06:32:48,632 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-20 06:32:48,632 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 370 transitions. [2022-07-20 06:32:48,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:32:48,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:48,641 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-20 06:32:48,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 06:32:48,642 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:48,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:48,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2069817048, now seen corresponding path program 1 times [2022-07-20 06:32:48,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:48,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216523324] [2022-07-20 06:32:48,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:48,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:48,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:48,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:48,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216523324] [2022-07-20 06:32:48,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216523324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:48,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:48,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:32:48,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11558493] [2022-07-20 06:32:48,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:48,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:32:48,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:48,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:32:48,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:32:48,700 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-20 06:32:48,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:48,797 INFO L93 Difference]: Finished difference Result 290 states and 394 transitions. [2022-07-20 06:32:48,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:32:48,797 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-20 06:32:48,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:48,799 INFO L225 Difference]: With dead ends: 290 [2022-07-20 06:32:48,800 INFO L226 Difference]: Without dead ends: 290 [2022-07-20 06:32:48,800 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-20 06:32:48,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-20 06:32:48,802 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-20 06:32:48,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-20 06:32:48,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2022-07-20 06:32:48,810 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-20 06:32:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 368 transitions. [2022-07-20 06:32:48,812 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 368 transitions. Word has length 34 [2022-07-20 06:32:48,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:48,813 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 368 transitions. [2022-07-20 06:32:48,813 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-20 06:32:48,813 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 368 transitions. [2022-07-20 06:32:48,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 06:32:48,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:48,816 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-20 06:32:48,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 06:32:48,816 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:48,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:48,817 INFO L85 PathProgramCache]: Analyzing trace with hash -382146908, now seen corresponding path program 1 times [2022-07-20 06:32:48,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:48,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837462246] [2022-07-20 06:32:48,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:48,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:48,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 06:32:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:48,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-20 06:32:48,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:48,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837462246] [2022-07-20 06:32:48,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837462246] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:48,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:48,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:32:48,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339538977] [2022-07-20 06:32:48,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:48,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:32:48,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:48,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:32:48,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:32:48,884 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-20 06:32:48,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:48,952 INFO L93 Difference]: Finished difference Result 262 states and 356 transitions. [2022-07-20 06:32:48,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:32:48,952 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-20 06:32:48,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:48,955 INFO L225 Difference]: With dead ends: 262 [2022-07-20 06:32:48,955 INFO L226 Difference]: Without dead ends: 232 [2022-07-20 06:32:48,956 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-20 06:32:48,957 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-20 06:32:48,957 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-20 06:32:48,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-20 06:32:48,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 210. [2022-07-20 06:32:48,965 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-20 06:32:48,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 287 transitions. [2022-07-20 06:32:48,967 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 287 transitions. Word has length 35 [2022-07-20 06:32:48,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:48,967 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 287 transitions. [2022-07-20 06:32:48,967 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-20 06:32:48,967 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 287 transitions. [2022-07-20 06:32:48,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 06:32:48,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:48,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:32:48,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 06:32:48,969 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:48,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:48,969 INFO L85 PathProgramCache]: Analyzing trace with hash 758626562, now seen corresponding path program 1 times [2022-07-20 06:32:48,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:48,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106785748] [2022-07-20 06:32:48,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:48,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:48,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 06:32:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:49,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 06:32:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:49,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:49,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106785748] [2022-07-20 06:32:49,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106785748] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:49,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:49,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:32:49,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181307025] [2022-07-20 06:32:49,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:49,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:32:49,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:49,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:32:49,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:32:49,013 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-20 06:32:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:49,130 INFO L93 Difference]: Finished difference Result 208 states and 283 transitions. [2022-07-20 06:32:49,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:32:49,130 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-20 06:32:49,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:49,132 INFO L225 Difference]: With dead ends: 208 [2022-07-20 06:32:49,132 INFO L226 Difference]: Without dead ends: 208 [2022-07-20 06:32:49,132 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-20 06:32:49,133 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-20 06:32:49,133 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-20 06:32:49,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-20 06:32:49,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-07-20 06:32:49,138 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-20 06:32:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 283 transitions. [2022-07-20 06:32:49,139 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 283 transitions. Word has length 39 [2022-07-20 06:32:49,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:49,139 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 283 transitions. [2022-07-20 06:32:49,139 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-20 06:32:49,140 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 283 transitions. [2022-07-20 06:32:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 06:32:49,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:49,141 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-20 06:32:49,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 06:32:49,141 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:49,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:49,142 INFO L85 PathProgramCache]: Analyzing trace with hash 143802726, now seen corresponding path program 1 times [2022-07-20 06:32:49,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:49,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909459504] [2022-07-20 06:32:49,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:49,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:49,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:49,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:49,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909459504] [2022-07-20 06:32:49,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909459504] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:49,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:49,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:32:49,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931278499] [2022-07-20 06:32:49,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:49,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:32:49,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:49,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:32:49,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:32:49,180 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-20 06:32:49,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:49,244 INFO L93 Difference]: Finished difference Result 217 states and 292 transitions. [2022-07-20 06:32:49,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:32:49,245 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-20 06:32:49,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:49,246 INFO L225 Difference]: With dead ends: 217 [2022-07-20 06:32:49,246 INFO L226 Difference]: Without dead ends: 186 [2022-07-20 06:32:49,247 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-20 06:32:49,247 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-20 06:32:49,256 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-20 06:32:49,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-20 06:32:49,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-07-20 06:32:49,260 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-20 06:32:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 251 transitions. [2022-07-20 06:32:49,262 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 251 transitions. Word has length 37 [2022-07-20 06:32:49,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:49,262 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 251 transitions. [2022-07-20 06:32:49,262 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-20 06:32:49,262 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 251 transitions. [2022-07-20 06:32:49,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 06:32:49,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:49,263 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-20 06:32:49,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 06:32:49,264 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:49,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:49,264 INFO L85 PathProgramCache]: Analyzing trace with hash -233541237, now seen corresponding path program 1 times [2022-07-20 06:32:49,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:49,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497363811] [2022-07-20 06:32:49,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:49,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:49,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 06:32:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:49,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:32:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:49,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:49,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:49,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497363811] [2022-07-20 06:32:49,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497363811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:49,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:49,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:32:49,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924719079] [2022-07-20 06:32:49,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:49,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:32:49,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:49,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:32:49,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:32:49,348 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-20 06:32:49,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:49,506 INFO L93 Difference]: Finished difference Result 211 states and 282 transitions. [2022-07-20 06:32:49,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:32:49,507 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-20 06:32:49,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:49,508 INFO L225 Difference]: With dead ends: 211 [2022-07-20 06:32:49,508 INFO L226 Difference]: Without dead ends: 204 [2022-07-20 06:32:49,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:32:49,509 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-20 06:32:49,510 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-20 06:32:49,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-20 06:32:49,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 194. [2022-07-20 06:32:49,514 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-20 06:32:49,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 260 transitions. [2022-07-20 06:32:49,515 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 260 transitions. Word has length 41 [2022-07-20 06:32:49,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:49,516 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 260 transitions. [2022-07-20 06:32:49,516 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-20 06:32:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 260 transitions. [2022-07-20 06:32:49,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:32:49,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:49,517 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-20 06:32:49,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 06:32:49,517 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:49,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:49,518 INFO L85 PathProgramCache]: Analyzing trace with hash 131822704, now seen corresponding path program 1 times [2022-07-20 06:32:49,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:49,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044197402] [2022-07-20 06:32:49,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:49,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:49,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 06:32:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:49,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:32:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:49,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:49,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044197402] [2022-07-20 06:32:49,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044197402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:49,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:49,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:32:49,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803245215] [2022-07-20 06:32:49,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:49,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:32:49,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:49,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:32:49,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:32:49,558 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-20 06:32:49,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:49,647 INFO L93 Difference]: Finished difference Result 207 states and 273 transitions. [2022-07-20 06:32:49,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:32:49,648 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-20 06:32:49,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:49,649 INFO L225 Difference]: With dead ends: 207 [2022-07-20 06:32:49,649 INFO L226 Difference]: Without dead ends: 205 [2022-07-20 06:32:49,649 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-20 06:32:49,650 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-20 06:32:49,650 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-20 06:32:49,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-20 06:32:49,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 196. [2022-07-20 06:32:49,654 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-20 06:32:49,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 261 transitions. [2022-07-20 06:32:49,655 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 261 transitions. Word has length 42 [2022-07-20 06:32:49,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:49,655 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 261 transitions. [2022-07-20 06:32:49,655 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-20 06:32:49,656 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 261 transitions. [2022-07-20 06:32:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 06:32:49,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:49,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:32:49,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 06:32:49,657 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:49,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:49,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1766604753, now seen corresponding path program 1 times [2022-07-20 06:32:49,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:49,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533015175] [2022-07-20 06:32:49,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:49,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:49,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 06:32:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:49,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:32:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:49,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:49,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:49,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533015175] [2022-07-20 06:32:49,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533015175] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:49,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:49,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:32:49,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067896823] [2022-07-20 06:32:49,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:49,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:32:49,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:49,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:32:49,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:32:49,717 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-20 06:32:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:49,891 INFO L93 Difference]: Finished difference Result 216 states and 286 transitions. [2022-07-20 06:32:49,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:32:49,892 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-20 06:32:49,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:49,893 INFO L225 Difference]: With dead ends: 216 [2022-07-20 06:32:49,893 INFO L226 Difference]: Without dead ends: 216 [2022-07-20 06:32:49,894 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-20 06:32:49,894 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-20 06:32:49,894 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-20 06:32:49,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-20 06:32:49,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 197. [2022-07-20 06:32:49,898 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-20 06:32:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 262 transitions. [2022-07-20 06:32:49,900 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 262 transitions. Word has length 43 [2022-07-20 06:32:49,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:49,900 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 262 transitions. [2022-07-20 06:32:49,900 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-20 06:32:49,900 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 262 transitions. [2022-07-20 06:32:49,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 06:32:49,901 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:49,901 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-20 06:32:49,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 06:32:49,902 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:49,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:49,902 INFO L85 PathProgramCache]: Analyzing trace with hash -446330305, now seen corresponding path program 1 times [2022-07-20 06:32:49,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:49,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114750071] [2022-07-20 06:32:49,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:49,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:49,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 06:32:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:49,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:32:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:49,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:49,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114750071] [2022-07-20 06:32:49,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114750071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:49,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:49,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:32:49,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948774019] [2022-07-20 06:32:49,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:49,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:32:49,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:49,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:32:49,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:32:49,957 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-20 06:32:50,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:50,043 INFO L93 Difference]: Finished difference Result 194 states and 255 transitions. [2022-07-20 06:32:50,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:32:50,043 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-20 06:32:50,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:50,044 INFO L225 Difference]: With dead ends: 194 [2022-07-20 06:32:50,045 INFO L226 Difference]: Without dead ends: 186 [2022-07-20 06:32:50,045 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-20 06:32:50,045 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-20 06:32:50,046 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-20 06:32:50,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-20 06:32:50,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2022-07-20 06:32:50,049 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-20 06:32:50,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 246 transitions. [2022-07-20 06:32:50,050 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 246 transitions. Word has length 43 [2022-07-20 06:32:50,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:50,050 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 246 transitions. [2022-07-20 06:32:50,051 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-20 06:32:50,051 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 246 transitions. [2022-07-20 06:32:50,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 06:32:50,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:50,052 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-20 06:32:50,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 06:32:50,052 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:50,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:50,053 INFO L85 PathProgramCache]: Analyzing trace with hash 694033782, now seen corresponding path program 1 times [2022-07-20 06:32:50,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:50,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77420357] [2022-07-20 06:32:50,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:50,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:50,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 06:32:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:50,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:32:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:50,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:50,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77420357] [2022-07-20 06:32:50,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77420357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:50,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:50,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:32:50,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208212649] [2022-07-20 06:32:50,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:50,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:32:50,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:50,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:32:50,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:32:50,129 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-20 06:32:50,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:50,199 INFO L93 Difference]: Finished difference Result 178 states and 237 transitions. [2022-07-20 06:32:50,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:32:50,200 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-20 06:32:50,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:50,201 INFO L225 Difference]: With dead ends: 178 [2022-07-20 06:32:50,201 INFO L226 Difference]: Without dead ends: 178 [2022-07-20 06:32:50,201 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-20 06:32:50,202 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 79 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:32:50,202 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-20 06:32:50,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-20 06:32:50,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-07-20 06:32:50,205 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-20 06:32:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 237 transitions. [2022-07-20 06:32:50,206 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 237 transitions. Word has length 44 [2022-07-20 06:32:50,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:50,207 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 237 transitions. [2022-07-20 06:32:50,207 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-20 06:32:50,207 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 237 transitions. [2022-07-20 06:32:50,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:32:50,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:50,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:32:50,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 06:32:50,208 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:50,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:50,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1239862159, now seen corresponding path program 1 times [2022-07-20 06:32:50,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:50,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832281601] [2022-07-20 06:32:50,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:50,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:50,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 06:32:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:50,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:50,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:50,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832281601] [2022-07-20 06:32:50,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832281601] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:50,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:50,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:32:50,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223410810] [2022-07-20 06:32:50,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:50,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:32:50,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:50,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:32:50,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:32:50,267 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-20 06:32:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:50,404 INFO L93 Difference]: Finished difference Result 176 states and 232 transitions. [2022-07-20 06:32:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:32:50,404 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-20 06:32:50,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:50,406 INFO L225 Difference]: With dead ends: 176 [2022-07-20 06:32:50,406 INFO L226 Difference]: Without dead ends: 176 [2022-07-20 06:32:50,406 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-20 06:32:50,407 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-20 06:32:50,407 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-20 06:32:50,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-20 06:32:50,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2022-07-20 06:32:50,410 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-20 06:32:50,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 230 transitions. [2022-07-20 06:32:50,411 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 230 transitions. Word has length 42 [2022-07-20 06:32:50,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:50,411 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 230 transitions. [2022-07-20 06:32:50,412 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-20 06:32:50,412 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 230 transitions. [2022-07-20 06:32:50,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:32:50,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:50,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:32:50,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 06:32:50,413 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:50,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:50,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1096582801, now seen corresponding path program 1 times [2022-07-20 06:32:50,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:50,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222311156] [2022-07-20 06:32:50,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:50,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:50,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 06:32:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:50,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:50,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:50,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222311156] [2022-07-20 06:32:50,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222311156] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:50,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:50,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:32:50,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370235140] [2022-07-20 06:32:50,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:50,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:32:50,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:50,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:32:50,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:32:50,484 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-20 06:32:50,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:50,632 INFO L93 Difference]: Finished difference Result 185 states and 241 transitions. [2022-07-20 06:32:50,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:32:50,633 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-20 06:32:50,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:50,634 INFO L225 Difference]: With dead ends: 185 [2022-07-20 06:32:50,634 INFO L226 Difference]: Without dead ends: 169 [2022-07-20 06:32:50,634 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-20 06:32:50,635 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-20 06:32:50,635 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-20 06:32:50,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-20 06:32:50,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-07-20 06:32:50,639 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-20 06:32:50,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 223 transitions. [2022-07-20 06:32:50,640 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 223 transitions. Word has length 42 [2022-07-20 06:32:50,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:50,641 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 223 transitions. [2022-07-20 06:32:50,641 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-20 06:32:50,641 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 223 transitions. [2022-07-20 06:32:50,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-20 06:32:50,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:50,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:32:50,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 06:32:50,642 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:50,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:50,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1105542194, now seen corresponding path program 1 times [2022-07-20 06:32:50,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:50,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002746081] [2022-07-20 06:32:50,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:50,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:50,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 06:32:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:50,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:32:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:50,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:50,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002746081] [2022-07-20 06:32:50,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002746081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:50,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:50,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:32:50,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788333439] [2022-07-20 06:32:50,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:50,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:32:50,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:50,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:32:50,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:32:50,678 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-20 06:32:50,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:50,722 INFO L93 Difference]: Finished difference Result 170 states and 223 transitions. [2022-07-20 06:32:50,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:32:50,722 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-20 06:32:50,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:50,723 INFO L225 Difference]: With dead ends: 170 [2022-07-20 06:32:50,723 INFO L226 Difference]: Without dead ends: 168 [2022-07-20 06:32:50,724 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-20 06:32:50,724 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-20 06:32:50,725 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-20 06:32:50,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-20 06:32:50,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-07-20 06:32:50,728 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-20 06:32:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 218 transitions. [2022-07-20 06:32:50,729 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 218 transitions. Word has length 48 [2022-07-20 06:32:50,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:50,729 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 218 transitions. [2022-07-20 06:32:50,730 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-20 06:32:50,730 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 218 transitions. [2022-07-20 06:32:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 06:32:50,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:50,731 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-20 06:32:50,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 06:32:50,731 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:50,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:50,732 INFO L85 PathProgramCache]: Analyzing trace with hash 364909914, now seen corresponding path program 1 times [2022-07-20 06:32:50,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:50,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071922339] [2022-07-20 06:32:50,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:50,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:50,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:32:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:50,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 06:32:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:50,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:50,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071922339] [2022-07-20 06:32:50,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071922339] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:50,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:50,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:32:50,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049983261] [2022-07-20 06:32:50,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:50,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:32:50,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:50,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:32:50,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:32:50,808 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-20 06:32:50,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:50,956 INFO L93 Difference]: Finished difference Result 177 states and 227 transitions. [2022-07-20 06:32:50,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:32:50,957 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-20 06:32:50,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:50,957 INFO L225 Difference]: With dead ends: 177 [2022-07-20 06:32:50,958 INFO L226 Difference]: Without dead ends: 145 [2022-07-20 06:32:50,958 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-20 06:32:50,958 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-20 06:32:50,959 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-20 06:32:50,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-20 06:32:50,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-07-20 06:32:50,962 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-20 06:32:50,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 183 transitions. [2022-07-20 06:32:50,962 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 183 transitions. Word has length 49 [2022-07-20 06:32:50,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:50,963 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 183 transitions. [2022-07-20 06:32:50,963 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-20 06:32:50,963 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 183 transitions. [2022-07-20 06:32:50,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 06:32:50,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:50,964 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-20 06:32:50,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 06:32:50,964 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:50,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:50,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1292109318, now seen corresponding path program 1 times [2022-07-20 06:32:50,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:50,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865658282] [2022-07-20 06:32:50,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:50,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:51,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:32:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:51,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:51,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865658282] [2022-07-20 06:32:51,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865658282] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:51,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:51,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:32:51,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137651525] [2022-07-20 06:32:51,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:51,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:32:51,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:51,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:32:51,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:32:51,032 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-20 06:32:51,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:51,250 INFO L93 Difference]: Finished difference Result 192 states and 234 transitions. [2022-07-20 06:32:51,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:32:51,259 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-20 06:32:51,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:51,261 INFO L225 Difference]: With dead ends: 192 [2022-07-20 06:32:51,261 INFO L226 Difference]: Without dead ends: 180 [2022-07-20 06:32:51,261 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-20 06:32:51,262 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 323 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:32:51,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 702 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:32:51,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-20 06:32:51,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 151. [2022-07-20 06:32:51,268 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-20 06:32:51,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 190 transitions. [2022-07-20 06:32:51,269 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 190 transitions. Word has length 43 [2022-07-20 06:32:51,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:51,270 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 190 transitions. [2022-07-20 06:32:51,270 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-20 06:32:51,270 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 190 transitions. [2022-07-20 06:32:51,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 06:32:51,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:51,271 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-20 06:32:51,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 06:32:51,272 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:51,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:51,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1608018874, now seen corresponding path program 1 times [2022-07-20 06:32:51,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:51,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713994085] [2022-07-20 06:32:51,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:51,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:51,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 06:32:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:51,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:51,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:32:51,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713994085] [2022-07-20 06:32:51,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713994085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:51,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:51,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:32:51,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122449605] [2022-07-20 06:32:51,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:51,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:32:51,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:32:51,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:32:51,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:32:51,342 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-20 06:32:51,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:51,489 INFO L93 Difference]: Finished difference Result 162 states and 201 transitions. [2022-07-20 06:32:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:32:51,490 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-20 06:32:51,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:51,491 INFO L225 Difference]: With dead ends: 162 [2022-07-20 06:32:51,491 INFO L226 Difference]: Without dead ends: 129 [2022-07-20 06:32:51,491 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-20 06:32:51,492 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-20 06:32:51,492 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-20 06:32:51,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-20 06:32:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-20 06:32:51,495 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-20 06:32:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2022-07-20 06:32:51,496 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 43 [2022-07-20 06:32:51,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:51,496 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2022-07-20 06:32:51,496 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-20 06:32:51,496 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2022-07-20 06:32:51,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 06:32:51,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:51,497 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-20 06:32:51,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 06:32:51,497 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:51,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:51,498 INFO L85 PathProgramCache]: Analyzing trace with hash -825515977, now seen corresponding path program 1 times [2022-07-20 06:32:51,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:32:51,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384180829] [2022-07-20 06:32:51,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:51,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:32:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 06:32:51,510 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 06:32:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 06:32:51,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-20 06:32:51,553 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 06:32:51,553 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-07-20 06:32:51,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-07-20 06:32:51,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-20 06:32:51,559 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-20 06:32:51,566 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 06:32:51,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 06:32:51 BoogieIcfgContainer [2022-07-20 06:32:51,646 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 06:32:51,647 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 06:32:51,647 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 06:32:51,647 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 06:32:51,647 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:32:46" (3/4) ... [2022-07-20 06:32:51,650 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-20 06:32:51,650 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 06:32:51,650 INFO L158 Benchmark]: Toolchain (without parser) took 6425.34ms. Allocated memory was 90.2MB in the beginning and 172.0MB in the end (delta: 81.8MB). Free memory was 57.3MB in the beginning and 94.9MB in the end (delta: -37.6MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. [2022-07-20 06:32:51,650 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 90.2MB. Free memory was 46.9MB in the beginning and 46.8MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 06:32:51,651 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.34ms. Allocated memory was 90.2MB in the beginning and 117.4MB in the end (delta: 27.3MB). Free memory was 57.1MB in the beginning and 86.1MB in the end (delta: -28.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-20 06:32:51,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.58ms. Allocated memory is still 117.4MB. Free memory was 86.1MB in the beginning and 82.7MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:32:51,651 INFO L158 Benchmark]: Boogie Preprocessor took 33.87ms. Allocated memory is still 117.4MB. Free memory was 82.7MB in the beginning and 79.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-20 06:32:51,651 INFO L158 Benchmark]: RCFGBuilder took 773.07ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 43.5MB in the end (delta: 36.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-07-20 06:32:51,652 INFO L158 Benchmark]: TraceAbstraction took 5078.75ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 42.9MB in the beginning and 94.9MB in the end (delta: -52.0MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2022-07-20 06:32:51,652 INFO L158 Benchmark]: Witness Printer took 3.31ms. Allocated memory is still 172.0MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 06:32:51,653 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.18ms. Allocated memory is still 90.2MB. Free memory was 46.9MB in the beginning and 46.8MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.34ms. Allocated memory was 90.2MB in the beginning and 117.4MB in the end (delta: 27.3MB). Free memory was 57.1MB in the beginning and 86.1MB in the end (delta: -28.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.58ms. Allocated memory is still 117.4MB. Free memory was 86.1MB in the beginning and 82.7MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.87ms. Allocated memory is still 117.4MB. Free memory was 82.7MB in the beginning and 79.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 773.07ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 43.5MB in the end (delta: 36.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5078.75ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 42.9MB in the beginning and 94.9MB in the end (delta: -52.0MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Witness Printer took 3.31ms. Allocated memory is still 172.0MB. Free memory is still 94.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.1s, 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, 18051 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12608 mSDsCounter, 503 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2789 IncrementalHoareTripleChecker+Invalid, 3292 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 503 mSolverCounterUnsat, 5443 mSDtfsCounter, 2789 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.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.3s 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-20 06:32:51,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a05fbc1d8a2048d37fda072c6a9d42f1f996d033c914869a4e2960aadff82dde --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:32:53,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:32:53,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:32:53,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:32:53,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:32:53,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:32:53,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:32:53,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:32:53,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:32:53,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:32:53,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:32:53,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:32:53,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:32:53,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:32:53,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:32:53,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:32:53,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:32:53,716 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:32:53,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:32:53,726 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:32:53,732 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:32:53,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:32:53,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:32:53,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:32:53,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:32:53,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:32:53,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:32:53,749 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:32:53,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:32:53,750 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:32:53,751 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:32:53,751 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:32:53,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:32:53,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:32:53,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:32:53,755 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:32:53,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:32:53,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:32:53,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:32:53,757 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:32:53,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:32:53,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:32:53,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 06:32:53,790 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:32:53,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:32:53,791 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:32:53,791 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:32:53,792 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:32:53,792 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:32:53,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:32:53,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:32:53,793 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:32:53,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:32:53,794 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:32:53,794 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:32:53,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:32:53,795 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:32:53,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:32:53,795 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:32:53,805 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:32:53,806 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:32:53,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:32:53,806 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:32:53,806 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 06:32:53,806 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 06:32:53,807 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:32:53,807 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:32:53,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:32:53,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:32:53,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:32:53,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:32:53,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:32:53,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:32:53,809 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 06:32:53,809 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 06:32:53,809 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 06:32:53,809 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-20 06:32:54,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:32:54,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:32:54,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:32:54,147 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:32:54,147 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:32:54,150 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-20 06:32:54,211 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65fb5e63b/d44de0fe97a84944890e0f4f55418244/FLAG7e8cef0fa [2022-07-20 06:32:54,750 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:32:54,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2022-07-20 06:32:54,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65fb5e63b/d44de0fe97a84944890e0f4f55418244/FLAG7e8cef0fa [2022-07-20 06:32:55,100 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65fb5e63b/d44de0fe97a84944890e0f4f55418244 [2022-07-20 06:32:55,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:32:55,103 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:32:55,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:32:55,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:32:55,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:32:55,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:32:55" (1/1) ... [2022-07-20 06:32:55,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70696a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:55, skipping insertion in model container [2022-07-20 06:32:55,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:32:55" (1/1) ... [2022-07-20 06:32:55,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:32:55,173 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:32:55,484 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-20 06:32:55,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:32:55,501 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:32:55,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-20 06:32:55,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:32:55,622 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:32:55,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:55 WrapperNode [2022-07-20 06:32:55,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:32:55,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:32:55,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:32:55,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:32:55,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:55" (1/1) ... [2022-07-20 06:32:55,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:55" (1/1) ... [2022-07-20 06:32:55,716 INFO L137 Inliner]: procedures = 29, calls = 44, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 607 [2022-07-20 06:32:55,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:32:55,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:32:55,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:32:55,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:32:55,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:55" (1/1) ... [2022-07-20 06:32:55,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:55" (1/1) ... [2022-07-20 06:32:55,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:55" (1/1) ... [2022-07-20 06:32:55,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:55" (1/1) ... [2022-07-20 06:32:55,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:55" (1/1) ... [2022-07-20 06:32:55,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:55" (1/1) ... [2022-07-20 06:32:55,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:55" (1/1) ... [2022-07-20 06:32:55,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:32:55,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:32:55,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:32:55,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:32:55,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:55" (1/1) ... [2022-07-20 06:32:55,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:32:55,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:32:55,841 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 06:32:55,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 06:32:55,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:32:55,880 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-07-20 06:32:55,880 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-07-20 06:32:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 06:32:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-20 06:32:55,881 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-20 06:32:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-07-20 06:32:55,881 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-07-20 06:32:55,881 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-20 06:32:55,882 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-20 06:32:55,882 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-20 06:32:55,882 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-20 06:32:55,882 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-20 06:32:55,882 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-20 06:32:55,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:32:55,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:32:55,883 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-07-20 06:32:55,883 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-07-20 06:32:56,072 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:32:56,073 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:32:56,198 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 06:32:56,204 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 06:32:56,208 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 06:32:56,212 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 06:32:56,216 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 06:32:56,552 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume !false; [2022-07-20 06:32:56,553 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume false; [2022-07-20 06:32:56,553 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##63: assume !false; [2022-07-20 06:32:56,553 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume false; [2022-07-20 06:32:56,553 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume false; [2022-07-20 06:32:56,553 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !false; [2022-07-20 06:32:56,554 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-07-20 06:32:56,554 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-07-20 06:32:56,554 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume !false; [2022-07-20 06:32:56,554 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume false; [2022-07-20 06:32:56,565 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 06:32:56,603 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-07-20 06:32:56,603 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-07-20 06:32:56,610 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:32:56,617 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:32:56,617 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 06:32:56,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:32:56 BoogieIcfgContainer [2022-07-20 06:32:56,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:32:56,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:32:56,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:32:56,623 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:32:56,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:32:55" (1/3) ... [2022-07-20 06:32:56,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f39395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:32:56, skipping insertion in model container [2022-07-20 06:32:56,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:32:55" (2/3) ... [2022-07-20 06:32:56,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f39395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:32:56, skipping insertion in model container [2022-07-20 06:32:56,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:32:56" (3/3) ... [2022-07-20 06:32:56,626 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2022-07-20 06:32:56,639 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:32:56,640 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-20 06:32:56,681 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:32:56,687 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@68f44453, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@72108666 [2022-07-20 06:32:56,687 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-20 06:32:56,692 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-20 06:32:56,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 06:32:56,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:56,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:32:56,699 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:56,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:56,703 INFO L85 PathProgramCache]: Analyzing trace with hash -15799092, now seen corresponding path program 1 times [2022-07-20 06:32:56,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:32:56,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509272668] [2022-07-20 06:32:56,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:56,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:32:56,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:32:56,719 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-20 06:32:56,722 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-20 06:32:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:56,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 06:32:56,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:32:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:56,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:32:56,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:32:56,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509272668] [2022-07-20 06:32:56,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509272668] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:56,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:56,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:32:56,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545779078] [2022-07-20 06:32:56,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:56,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:32:56,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:32:56,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:32:56,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:32:56,885 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-20 06:32:56,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:56,941 INFO L93 Difference]: Finished difference Result 212 states and 315 transitions. [2022-07-20 06:32:56,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:32:56,944 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-20 06:32:56,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:56,953 INFO L225 Difference]: With dead ends: 212 [2022-07-20 06:32:56,953 INFO L226 Difference]: Without dead ends: 208 [2022-07-20 06:32:56,955 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-20 06:32:56,962 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-20 06:32:56,962 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-20 06:32:56,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-20 06:32:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2022-07-20 06:32:57,000 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-20 06:32:57,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 310 transitions. [2022-07-20 06:32:57,005 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 310 transitions. Word has length 8 [2022-07-20 06:32:57,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:57,005 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 310 transitions. [2022-07-20 06:32:57,005 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-20 06:32:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 310 transitions. [2022-07-20 06:32:57,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 06:32:57,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:57,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:32:57,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-20 06:32:57,217 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-20 06:32:57,217 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:57,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:57,218 INFO L85 PathProgramCache]: Analyzing trace with hash -191249986, now seen corresponding path program 1 times [2022-07-20 06:32:57,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:32:57,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548367695] [2022-07-20 06:32:57,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:57,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:32:57,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:32:57,221 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-20 06:32:57,223 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-20 06:32:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:57,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 06:32:57,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:32:57,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:57,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:32:57,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:32:57,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548367695] [2022-07-20 06:32:57,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548367695] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:57,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:57,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:32:57,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813523878] [2022-07-20 06:32:57,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:57,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:32:57,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:32:57,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:32:57,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:32:57,361 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-20 06:32:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:57,421 INFO L93 Difference]: Finished difference Result 205 states and 309 transitions. [2022-07-20 06:32:57,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:32:57,421 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-20 06:32:57,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:57,423 INFO L225 Difference]: With dead ends: 205 [2022-07-20 06:32:57,423 INFO L226 Difference]: Without dead ends: 201 [2022-07-20 06:32:57,424 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-20 06:32:57,426 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-20 06:32:57,426 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-20 06:32:57,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-20 06:32:57,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-07-20 06:32:57,438 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-20 06:32:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 296 transitions. [2022-07-20 06:32:57,441 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 296 transitions. Word has length 15 [2022-07-20 06:32:57,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:57,441 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 296 transitions. [2022-07-20 06:32:57,441 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-20 06:32:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 296 transitions. [2022-07-20 06:32:57,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 06:32:57,442 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:57,442 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-20 06:32:57,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 06:32:57,652 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-20 06:32:57,652 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:57,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:57,653 INFO L85 PathProgramCache]: Analyzing trace with hash 509601447, now seen corresponding path program 1 times [2022-07-20 06:32:57,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:32:57,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963275412] [2022-07-20 06:32:57,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:57,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:32:57,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:32:57,655 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-20 06:32:57,657 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-20 06:32:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:57,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 06:32:57,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:32:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:57,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:32:57,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:32:57,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963275412] [2022-07-20 06:32:57,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963275412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:57,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:57,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:32:57,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610337996] [2022-07-20 06:32:57,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:57,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:32:57,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:32:57,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:32:57,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:32:57,896 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-20 06:32:58,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:58,093 INFO L93 Difference]: Finished difference Result 269 states and 381 transitions. [2022-07-20 06:32:58,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:32:58,094 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-20 06:32:58,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:58,096 INFO L225 Difference]: With dead ends: 269 [2022-07-20 06:32:58,096 INFO L226 Difference]: Without dead ends: 268 [2022-07-20 06:32:58,097 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-20 06:32:58,098 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 360 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:32:58,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 394 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:32:58,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-20 06:32:58,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 252. [2022-07-20 06:32:58,114 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-20 06:32:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 361 transitions. [2022-07-20 06:32:58,117 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 361 transitions. Word has length 19 [2022-07-20 06:32:58,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:58,117 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 361 transitions. [2022-07-20 06:32:58,117 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-20 06:32:58,118 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 361 transitions. [2022-07-20 06:32:58,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 06:32:58,118 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:58,119 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-20 06:32:58,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-20 06:32:58,328 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-20 06:32:58,328 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:58,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:58,329 INFO L85 PathProgramCache]: Analyzing trace with hash -2016043468, now seen corresponding path program 1 times [2022-07-20 06:32:58,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:32:58,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266731655] [2022-07-20 06:32:58,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:58,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:32:58,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:32:58,331 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-20 06:32:58,333 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-20 06:32:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:58,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 06:32:58,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:32:58,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:58,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:32:58,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:32:58,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266731655] [2022-07-20 06:32:58,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266731655] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:58,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:58,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:32:58,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988918583] [2022-07-20 06:32:58,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:58,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:32:58,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:32:58,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:32:58,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:32:58,436 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-20 06:32:58,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:58,455 INFO L93 Difference]: Finished difference Result 312 states and 436 transitions. [2022-07-20 06:32:58,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:32:58,457 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-20 06:32:58,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:58,459 INFO L225 Difference]: With dead ends: 312 [2022-07-20 06:32:58,459 INFO L226 Difference]: Without dead ends: 312 [2022-07-20 06:32:58,465 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-20 06:32:58,466 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-20 06:32:58,466 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-20 06:32:58,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-20 06:32:58,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 290. [2022-07-20 06:32:58,478 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-20 06:32:58,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 410 transitions. [2022-07-20 06:32:58,480 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 410 transitions. Word has length 18 [2022-07-20 06:32:58,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:58,480 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 410 transitions. [2022-07-20 06:32:58,480 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-20 06:32:58,481 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 410 transitions. [2022-07-20 06:32:58,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:32:58,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:58,483 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-20 06:32:58,491 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-20 06:32:58,691 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-20 06:32:58,692 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:58,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:58,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1363549369, now seen corresponding path program 1 times [2022-07-20 06:32:58,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:32:58,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333072195] [2022-07-20 06:32:58,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:58,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:32:58,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:32:58,694 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-20 06:32:58,695 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-20 06:32:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:58,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:32:58,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:32:58,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-20 06:32:58,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:32:58,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:32:58,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333072195] [2022-07-20 06:32:58,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [333072195] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:58,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:58,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:32:58,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882916164] [2022-07-20 06:32:58,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:58,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:32:58,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:32:58,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:32:58,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:32:58,920 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-20 06:32:59,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:59,053 INFO L93 Difference]: Finished difference Result 289 states and 407 transitions. [2022-07-20 06:32:59,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:32:59,054 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-20 06:32:59,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:59,056 INFO L225 Difference]: With dead ends: 289 [2022-07-20 06:32:59,056 INFO L226 Difference]: Without dead ends: 289 [2022-07-20 06:32:59,056 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-20 06:32:59,057 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-20 06:32:59,057 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-20 06:32:59,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-20 06:32:59,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2022-07-20 06:32:59,066 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-20 06:32:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 407 transitions. [2022-07-20 06:32:59,068 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 407 transitions. Word has length 29 [2022-07-20 06:32:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:59,068 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 407 transitions. [2022-07-20 06:32:59,068 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-20 06:32:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 407 transitions. [2022-07-20 06:32:59,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 06:32:59,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:59,071 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-20 06:32:59,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-20 06:32:59,280 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-20 06:32:59,281 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:59,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:59,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1270637010, now seen corresponding path program 1 times [2022-07-20 06:32:59,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:32:59,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640573664] [2022-07-20 06:32:59,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:59,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:32:59,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:32:59,284 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-20 06:32:59,285 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-20 06:32:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:32:59,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:32:59,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:32:59,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:32:59,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:32:59,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:32:59,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640573664] [2022-07-20 06:32:59,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640573664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:32:59,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:32:59,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:32:59,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119677727] [2022-07-20 06:32:59,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:32:59,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:32:59,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:32:59,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:32:59,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:32:59,537 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-20 06:32:59,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:32:59,708 INFO L93 Difference]: Finished difference Result 307 states and 427 transitions. [2022-07-20 06:32:59,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:32:59,709 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-20 06:32:59,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:32:59,711 INFO L225 Difference]: With dead ends: 307 [2022-07-20 06:32:59,711 INFO L226 Difference]: Without dead ends: 306 [2022-07-20 06:32:59,711 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-20 06:32:59,712 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-20 06:32:59,712 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-20 06:32:59,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-20 06:32:59,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2022-07-20 06:32:59,720 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-20 06:32:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 422 transitions. [2022-07-20 06:32:59,722 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 422 transitions. Word has length 33 [2022-07-20 06:32:59,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:32:59,722 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 422 transitions. [2022-07-20 06:32:59,722 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-20 06:32:59,723 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 422 transitions. [2022-07-20 06:32:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:32:59,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:32:59,724 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-20 06:32:59,740 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-20 06:32:59,934 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-20 06:32:59,934 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:32:59,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:32:59,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1113906492, now seen corresponding path program 1 times [2022-07-20 06:32:59,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:32:59,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775999882] [2022-07-20 06:32:59,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:32:59,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:32:59,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:32:59,937 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-20 06:32:59,939 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-20 06:33:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:00,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:33:00,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:00,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:00,143 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:33:00,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:33:00,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775999882] [2022-07-20 06:33:00,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775999882] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:00,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:00,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:33:00,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124661071] [2022-07-20 06:33:00,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:00,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:33:00,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:33:00,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:33:00,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:33:00,146 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-20 06:33:00,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:00,305 INFO L93 Difference]: Finished difference Result 306 states and 425 transitions. [2022-07-20 06:33:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:33:00,306 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-20 06:33:00,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:00,307 INFO L225 Difference]: With dead ends: 306 [2022-07-20 06:33:00,308 INFO L226 Difference]: Without dead ends: 306 [2022-07-20 06:33:00,308 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-20 06:33:00,308 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-20 06:33:00,309 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-20 06:33:00,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-20 06:33:00,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2022-07-20 06:33:00,316 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-20 06:33:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 421 transitions. [2022-07-20 06:33:00,317 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 421 transitions. Word has length 34 [2022-07-20 06:33:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:00,318 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 421 transitions. [2022-07-20 06:33:00,318 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-20 06:33:00,318 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 421 transitions. [2022-07-20 06:33:00,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:33:00,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:00,319 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-20 06:33:00,331 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-20 06:33:00,528 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-20 06:33:00,529 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:33:00,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:00,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2136327390, now seen corresponding path program 1 times [2022-07-20 06:33:00,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:33:00,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308015798] [2022-07-20 06:33:00,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:00,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:33:00,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:33:00,531 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-20 06:33:00,533 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-20 06:33:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:00,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 06:33:00,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:00,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:33:00,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:33:00,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308015798] [2022-07-20 06:33:00,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1308015798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:00,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:00,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:33:00,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990563229] [2022-07-20 06:33:00,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:00,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:33:00,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:33:00,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:33:00,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:33:00,638 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-20 06:33:00,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:00,655 INFO L93 Difference]: Finished difference Result 282 states and 385 transitions. [2022-07-20 06:33:00,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:33:00,656 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-20 06:33:00,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:00,658 INFO L225 Difference]: With dead ends: 282 [2022-07-20 06:33:00,658 INFO L226 Difference]: Without dead ends: 282 [2022-07-20 06:33:00,658 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-20 06:33:00,661 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-20 06:33:00,661 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-20 06:33:00,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-20 06:33:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 268. [2022-07-20 06:33:00,671 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-20 06:33:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 370 transitions. [2022-07-20 06:33:00,673 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 370 transitions. Word has length 34 [2022-07-20 06:33:00,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:00,673 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 370 transitions. [2022-07-20 06:33:00,674 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-20 06:33:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 370 transitions. [2022-07-20 06:33:00,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:33:00,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:00,675 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-20 06:33:00,690 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-20 06:33:00,884 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-20 06:33:00,885 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:33:00,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:00,886 INFO L85 PathProgramCache]: Analyzing trace with hash -2069817048, now seen corresponding path program 1 times [2022-07-20 06:33:00,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:33:00,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784708697] [2022-07-20 06:33:00,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:00,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:33:00,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:33:00,888 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-20 06:33:00,888 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-20 06:33:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:00,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:33:00,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:01,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:33:01,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:33:01,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784708697] [2022-07-20 06:33:01,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784708697] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:01,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:01,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:33:01,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548857157] [2022-07-20 06:33:01,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:01,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:33:01,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:33:01,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:33:01,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:33:01,039 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-20 06:33:01,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:01,168 INFO L93 Difference]: Finished difference Result 268 states and 368 transitions. [2022-07-20 06:33:01,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:33:01,169 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-20 06:33:01,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:01,170 INFO L225 Difference]: With dead ends: 268 [2022-07-20 06:33:01,170 INFO L226 Difference]: Without dead ends: 268 [2022-07-20 06:33:01,170 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-20 06:33:01,170 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-20 06:33:01,171 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-20 06:33:01,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-20 06:33:01,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2022-07-20 06:33:01,176 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-20 06:33:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 368 transitions. [2022-07-20 06:33:01,177 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 368 transitions. Word has length 34 [2022-07-20 06:33:01,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:01,178 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 368 transitions. [2022-07-20 06:33:01,178 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-20 06:33:01,178 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 368 transitions. [2022-07-20 06:33:01,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 06:33:01,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:01,179 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-20 06:33:01,191 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-20 06:33:01,379 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-20 06:33:01,380 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:33:01,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:01,380 INFO L85 PathProgramCache]: Analyzing trace with hash -382146908, now seen corresponding path program 1 times [2022-07-20 06:33:01,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:33:01,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826223081] [2022-07-20 06:33:01,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:01,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:33:01,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:33:01,383 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-20 06:33:01,419 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-20 06:33:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:01,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 06:33:01,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:01,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-20 06:33:01,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:33:01,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:33:01,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826223081] [2022-07-20 06:33:01,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826223081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:01,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:01,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:33:01,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524043377] [2022-07-20 06:33:01,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:01,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:33:01,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:33:01,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:33:01,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:33:01,501 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-20 06:33:01,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:01,514 INFO L93 Difference]: Finished difference Result 262 states and 356 transitions. [2022-07-20 06:33:01,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:33:01,514 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-20 06:33:01,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:01,516 INFO L225 Difference]: With dead ends: 262 [2022-07-20 06:33:01,516 INFO L226 Difference]: Without dead ends: 232 [2022-07-20 06:33:01,516 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-20 06:33:01,516 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-20 06:33:01,517 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-20 06:33:01,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-20 06:33:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 210. [2022-07-20 06:33:01,521 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-20 06:33:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 287 transitions. [2022-07-20 06:33:01,522 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 287 transitions. Word has length 35 [2022-07-20 06:33:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:01,522 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 287 transitions. [2022-07-20 06:33:01,523 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-20 06:33:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 287 transitions. [2022-07-20 06:33:01,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 06:33:01,523 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:01,524 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-20 06:33:01,535 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-20 06:33:01,733 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-20 06:33:01,733 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:33:01,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:01,734 INFO L85 PathProgramCache]: Analyzing trace with hash 758626562, now seen corresponding path program 1 times [2022-07-20 06:33:01,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:33:01,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807858764] [2022-07-20 06:33:01,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:01,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:33:01,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:33:01,736 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-20 06:33:01,738 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-20 06:33:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:01,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 06:33:01,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:01,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:01,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:33:01,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:33:01,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807858764] [2022-07-20 06:33:01,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807858764] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:01,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:01,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:33:01,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067733209] [2022-07-20 06:33:01,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:01,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:33:01,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:33:01,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:33:01,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:33:01,841 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-20 06:33:01,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:01,892 INFO L93 Difference]: Finished difference Result 208 states and 283 transitions. [2022-07-20 06:33:01,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:33:01,892 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-20 06:33:01,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:01,894 INFO L225 Difference]: With dead ends: 208 [2022-07-20 06:33:01,894 INFO L226 Difference]: Without dead ends: 208 [2022-07-20 06:33:01,894 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-20 06:33:01,895 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-20 06:33:01,895 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-20 06:33:01,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-20 06:33:01,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-07-20 06:33:01,899 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-20 06:33:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 283 transitions. [2022-07-20 06:33:01,901 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 283 transitions. Word has length 39 [2022-07-20 06:33:01,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:01,901 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 283 transitions. [2022-07-20 06:33:01,901 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-20 06:33:01,901 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 283 transitions. [2022-07-20 06:33:01,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 06:33:01,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:01,902 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-20 06:33:01,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-20 06:33:02,111 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-20 06:33:02,112 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:33:02,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:02,112 INFO L85 PathProgramCache]: Analyzing trace with hash 143802726, now seen corresponding path program 1 times [2022-07-20 06:33:02,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:33:02,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423370707] [2022-07-20 06:33:02,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:02,113 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:33:02,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:33:02,114 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-20 06:33:02,115 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-20 06:33:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:02,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 06:33:02,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:02,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-20 06:33:02,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:33:02,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:33:02,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423370707] [2022-07-20 06:33:02,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423370707] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:02,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:02,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:33:02,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676102908] [2022-07-20 06:33:02,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:02,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:33:02,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:33:02,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:33:02,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:33:02,260 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-20 06:33:02,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:02,421 INFO L93 Difference]: Finished difference Result 224 states and 301 transitions. [2022-07-20 06:33:02,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:33:02,422 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-20 06:33:02,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:02,423 INFO L225 Difference]: With dead ends: 224 [2022-07-20 06:33:02,423 INFO L226 Difference]: Without dead ends: 207 [2022-07-20 06:33:02,423 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-20 06:33:02,423 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-20 06:33:02,424 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-20 06:33:02,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-20 06:33:02,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-07-20 06:33:02,428 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-20 06:33:02,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 281 transitions. [2022-07-20 06:33:02,429 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 281 transitions. Word has length 37 [2022-07-20 06:33:02,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:02,429 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 281 transitions. [2022-07-20 06:33:02,429 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-20 06:33:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 281 transitions. [2022-07-20 06:33:02,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:33:02,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:02,430 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-20 06:33:02,438 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-20 06:33:02,631 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-20 06:33:02,631 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:33:02,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:02,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1174329751, now seen corresponding path program 1 times [2022-07-20 06:33:02,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:33:02,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078997168] [2022-07-20 06:33:02,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:02,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:33:02,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:33:02,633 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-20 06:33:02,634 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-20 06:33:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:02,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 06:33:02,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:02,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:02,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:33:02,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:33:02,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078997168] [2022-07-20 06:33:02,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078997168] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:02,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:02,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:33:02,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813516006] [2022-07-20 06:33:02,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:02,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:33:02,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:33:02,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:33:02,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:33:02,779 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-20 06:33:02,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:02,890 INFO L93 Difference]: Finished difference Result 223 states and 299 transitions. [2022-07-20 06:33:02,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:33:02,891 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-20 06:33:02,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:02,892 INFO L225 Difference]: With dead ends: 223 [2022-07-20 06:33:02,892 INFO L226 Difference]: Without dead ends: 206 [2022-07-20 06:33:02,892 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-20 06:33:02,893 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-20 06:33:02,893 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-20 06:33:02,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-20 06:33:02,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-07-20 06:33:02,897 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-20 06:33:02,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 279 transitions. [2022-07-20 06:33:02,898 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 279 transitions. Word has length 38 [2022-07-20 06:33:02,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:02,899 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 279 transitions. [2022-07-20 06:33:02,899 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-20 06:33:02,899 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 279 transitions. [2022-07-20 06:33:02,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:33:02,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:02,900 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-20 06:33:02,913 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-20 06:33:03,111 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-20 06:33:03,111 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:33:03,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:03,112 INFO L85 PathProgramCache]: Analyzing trace with hash -461855063, now seen corresponding path program 1 times [2022-07-20 06:33:03,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:33:03,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439206859] [2022-07-20 06:33:03,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:03,113 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:33:03,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:33:03,114 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-20 06:33:03,116 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-20 06:33:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:03,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 06:33:03,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:03,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:33:03,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:33:03,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439206859] [2022-07-20 06:33:03,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439206859] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:03,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:03,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:33:03,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540639688] [2022-07-20 06:33:03,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:03,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:33:03,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:33:03,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:33:03,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:33:03,266 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-20 06:33:03,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:03,364 INFO L93 Difference]: Finished difference Result 215 states and 288 transitions. [2022-07-20 06:33:03,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:33:03,365 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-20 06:33:03,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:03,366 INFO L225 Difference]: With dead ends: 215 [2022-07-20 06:33:03,366 INFO L226 Difference]: Without dead ends: 186 [2022-07-20 06:33:03,366 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-20 06:33:03,367 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-20 06:33:03,367 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-20 06:33:03,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-20 06:33:03,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-07-20 06:33:03,371 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-20 06:33:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 251 transitions. [2022-07-20 06:33:03,372 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 251 transitions. Word has length 38 [2022-07-20 06:33:03,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:03,373 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 251 transitions. [2022-07-20 06:33:03,373 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-20 06:33:03,373 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 251 transitions. [2022-07-20 06:33:03,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 06:33:03,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:03,374 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-20 06:33:03,389 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-20 06:33:03,583 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-20 06:33:03,584 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:33:03,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:03,584 INFO L85 PathProgramCache]: Analyzing trace with hash -233541237, now seen corresponding path program 1 times [2022-07-20 06:33:03,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:33:03,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270763889] [2022-07-20 06:33:03,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:03,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:33:03,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:33:03,586 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-20 06:33:03,588 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-20 06:33:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:03,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:33:03,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:03,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-20 06:33:03,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:33:03,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:33:03,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270763889] [2022-07-20 06:33:03,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270763889] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:03,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:03,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:33:03,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881209414] [2022-07-20 06:33:03,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:03,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:33:03,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:33:03,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:33:03,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:33:03,710 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-20 06:33:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:03,725 INFO L93 Difference]: Finished difference Result 179 states and 241 transitions. [2022-07-20 06:33:03,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:33:03,726 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-20 06:33:03,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:03,727 INFO L225 Difference]: With dead ends: 179 [2022-07-20 06:33:03,727 INFO L226 Difference]: Without dead ends: 179 [2022-07-20 06:33:03,729 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-20 06:33:03,729 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-20 06:33:03,730 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-20 06:33:03,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-20 06:33:03,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2022-07-20 06:33:03,736 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-20 06:33:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 241 transitions. [2022-07-20 06:33:03,738 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 241 transitions. Word has length 41 [2022-07-20 06:33:03,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:03,739 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 241 transitions. [2022-07-20 06:33:03,739 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-20 06:33:03,739 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 241 transitions. [2022-07-20 06:33:03,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:33:03,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:03,740 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-20 06:33:03,755 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-20 06:33:03,950 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-20 06:33:03,950 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:33:03,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:03,951 INFO L85 PathProgramCache]: Analyzing trace with hash 348485743, now seen corresponding path program 1 times [2022-07-20 06:33:03,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:33:03,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992079307] [2022-07-20 06:33:03,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:03,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:33:03,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:33:03,952 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-20 06:33:03,953 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-20 06:33:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:04,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:33:04,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:04,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:33:04,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:33:04,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992079307] [2022-07-20 06:33:04,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992079307] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:04,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:04,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:33:04,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959768050] [2022-07-20 06:33:04,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:04,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:33:04,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:33:04,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:33:04,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:33:04,142 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-20 06:33:04,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:04,314 INFO L93 Difference]: Finished difference Result 178 states and 238 transitions. [2022-07-20 06:33:04,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:33:04,315 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-20 06:33:04,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:04,316 INFO L225 Difference]: With dead ends: 178 [2022-07-20 06:33:04,316 INFO L226 Difference]: Without dead ends: 178 [2022-07-20 06:33:04,316 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-20 06:33:04,317 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-20 06:33:04,317 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-20 06:33:04,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-20 06:33:04,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-07-20 06:33:04,320 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-20 06:33:04,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 238 transitions. [2022-07-20 06:33:04,321 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 238 transitions. Word has length 42 [2022-07-20 06:33:04,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:04,321 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 238 transitions. [2022-07-20 06:33:04,321 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-20 06:33:04,322 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 238 transitions. [2022-07-20 06:33:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:33:04,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:04,322 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-20 06:33:04,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-20 06:33:04,523 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-20 06:33:04,523 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:33:04,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:04,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1096582801, now seen corresponding path program 1 times [2022-07-20 06:33:04,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:33:04,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48850602] [2022-07-20 06:33:04,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:04,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:33:04,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:33:04,526 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-20 06:33:04,528 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-20 06:33:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:04,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:33:04,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:04,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:04,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:33:04,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:33:04,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48850602] [2022-07-20 06:33:04,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48850602] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:04,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:04,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:33:04,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313552325] [2022-07-20 06:33:04,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:04,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:33:04,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:33:04,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:33:04,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:33:04,783 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-20 06:33:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:04,990 INFO L93 Difference]: Finished difference Result 231 states and 302 transitions. [2022-07-20 06:33:04,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:33:04,990 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-20 06:33:04,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:04,991 INFO L225 Difference]: With dead ends: 231 [2022-07-20 06:33:04,991 INFO L226 Difference]: Without dead ends: 218 [2022-07-20 06:33:04,992 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-20 06:33:04,992 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 208 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:33:04,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1183 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:33:04,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-20 06:33:04,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 187. [2022-07-20 06:33:04,997 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-20 06:33:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 249 transitions. [2022-07-20 06:33:04,998 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 249 transitions. Word has length 42 [2022-07-20 06:33:04,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:04,999 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 249 transitions. [2022-07-20 06:33:04,999 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-20 06:33:04,999 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 249 transitions. [2022-07-20 06:33:05,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-20 06:33:05,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:05,000 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-20 06:33:05,012 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-20 06:33:05,210 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-20 06:33:05,210 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:33:05,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:05,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1105542194, now seen corresponding path program 1 times [2022-07-20 06:33:05,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:33:05,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799969471] [2022-07-20 06:33:05,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:05,211 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:33:05,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:33:05,213 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-20 06:33:05,214 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-20 06:33:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:05,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 06:33:05,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:05,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:05,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:33:05,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:33:05,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799969471] [2022-07-20 06:33:05,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799969471] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:05,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:05,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:33:05,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601661070] [2022-07-20 06:33:05,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:05,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:33:05,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:33:05,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:33:05,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:33:05,307 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-20 06:33:05,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:05,317 INFO L93 Difference]: Finished difference Result 188 states and 249 transitions. [2022-07-20 06:33:05,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:33:05,318 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-20 06:33:05,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:05,319 INFO L225 Difference]: With dead ends: 188 [2022-07-20 06:33:05,319 INFO L226 Difference]: Without dead ends: 187 [2022-07-20 06:33:05,319 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-20 06:33:05,320 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-20 06:33:05,320 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-20 06:33:05,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-20 06:33:05,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-20 06:33:05,324 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-20 06:33:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 248 transitions. [2022-07-20 06:33:05,325 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 248 transitions. Word has length 48 [2022-07-20 06:33:05,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:05,326 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 248 transitions. [2022-07-20 06:33:05,326 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-20 06:33:05,326 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 248 transitions. [2022-07-20 06:33:05,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 06:33:05,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:05,327 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-20 06:33:05,337 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-20 06:33:05,537 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-20 06:33:05,537 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:33:05,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:05,537 INFO L85 PathProgramCache]: Analyzing trace with hash 437296472, now seen corresponding path program 1 times [2022-07-20 06:33:05,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:33:05,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716047767] [2022-07-20 06:33:05,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:05,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:33:05,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:33:05,539 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-20 06:33:05,542 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-20 06:33:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:05,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 06:33:05,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:05,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:33:05,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:33:05,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716047767] [2022-07-20 06:33:05,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716047767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:05,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:05,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:33:05,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085801477] [2022-07-20 06:33:05,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:05,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:33:05,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:33:05,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:33:05,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:33:05,651 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-20 06:33:05,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:05,660 INFO L93 Difference]: Finished difference Result 188 states and 248 transitions. [2022-07-20 06:33:05,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:33:05,661 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-20 06:33:05,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:05,663 INFO L225 Difference]: With dead ends: 188 [2022-07-20 06:33:05,663 INFO L226 Difference]: Without dead ends: 187 [2022-07-20 06:33:05,663 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-20 06:33:05,663 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-20 06:33:05,664 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-20 06:33:05,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-20 06:33:05,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-20 06:33:05,669 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-20 06:33:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 246 transitions. [2022-07-20 06:33:05,670 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 246 transitions. Word has length 49 [2022-07-20 06:33:05,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:05,671 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 246 transitions. [2022-07-20 06:33:05,671 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-20 06:33:05,671 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 246 transitions. [2022-07-20 06:33:05,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 06:33:05,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:05,672 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-20 06:33:05,684 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-20 06:33:05,881 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-20 06:33:05,882 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:33:05,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:05,882 INFO L85 PathProgramCache]: Analyzing trace with hash 364909914, now seen corresponding path program 1 times [2022-07-20 06:33:05,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:33:05,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119751047] [2022-07-20 06:33:05,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:05,883 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:33:05,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:33:05,884 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-20 06:33:05,885 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-20 06:33:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:05,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 06:33:05,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:06,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:33:06,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:33:06,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119751047] [2022-07-20 06:33:06,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119751047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:06,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:06,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:33:06,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960058904] [2022-07-20 06:33:06,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:06,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:33:06,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:33:06,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:33:06,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:33:06,098 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-20 06:33:06,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:06,307 INFO L93 Difference]: Finished difference Result 232 states and 299 transitions. [2022-07-20 06:33:06,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:33:06,308 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-20 06:33:06,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:06,309 INFO L225 Difference]: With dead ends: 232 [2022-07-20 06:33:06,309 INFO L226 Difference]: Without dead ends: 221 [2022-07-20 06:33:06,310 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-20 06:33:06,310 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 135 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:33:06,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1662 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:33:06,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-20 06:33:06,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 190. [2022-07-20 06:33:06,314 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-20 06:33:06,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 249 transitions. [2022-07-20 06:33:06,315 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 249 transitions. Word has length 49 [2022-07-20 06:33:06,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:06,316 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 249 transitions. [2022-07-20 06:33:06,316 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-20 06:33:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 249 transitions. [2022-07-20 06:33:06,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 06:33:06,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:06,317 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-20 06:33:06,329 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-20 06:33:06,517 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-20 06:33:06,517 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:33:06,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:06,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1169166180, now seen corresponding path program 1 times [2022-07-20 06:33:06,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:33:06,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046471139] [2022-07-20 06:33:06,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:06,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:33:06,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:33:06,532 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-20 06:33:06,533 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-20 06:33:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:06,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:33:06,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:06,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:33:06,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:33:06,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046471139] [2022-07-20 06:33:06,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046471139] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:06,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:06,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:33:06,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620872201] [2022-07-20 06:33:06,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:06,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:33:06,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:33:06,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:33:06,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:33:06,766 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-20 06:33:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:06,847 INFO L93 Difference]: Finished difference Result 190 states and 247 transitions. [2022-07-20 06:33:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:33:06,848 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-20 06:33:06,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:06,849 INFO L225 Difference]: With dead ends: 190 [2022-07-20 06:33:06,849 INFO L226 Difference]: Without dead ends: 190 [2022-07-20 06:33:06,850 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-20 06:33:06,850 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-20 06:33:06,850 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-20 06:33:06,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-20 06:33:06,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-07-20 06:33:06,854 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-20 06:33:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2022-07-20 06:33:06,855 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 45 [2022-07-20 06:33:06,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:06,855 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2022-07-20 06:33:06,855 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-20 06:33:06,855 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2022-07-20 06:33:06,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 06:33:06,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:06,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:33:06,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-20 06:33:07,066 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-20 06:33:07,066 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:33:07,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:07,069 INFO L85 PathProgramCache]: Analyzing trace with hash -648920610, now seen corresponding path program 1 times [2022-07-20 06:33:07,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:33:07,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320942988] [2022-07-20 06:33:07,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:07,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:33:07,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:33:07,071 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-20 06:33:07,074 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-20 06:33:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:07,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:33:07,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:07,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:07,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:33:07,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:33:07,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320942988] [2022-07-20 06:33:07,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320942988] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:07,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:07,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:33:07,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023027042] [2022-07-20 06:33:07,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:07,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:33:07,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:33:07,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:33:07,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:33:07,262 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-20 06:33:07,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:07,423 INFO L93 Difference]: Finished difference Result 214 states and 274 transitions. [2022-07-20 06:33:07,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:33:07,426 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-20 06:33:07,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:07,427 INFO L225 Difference]: With dead ends: 214 [2022-07-20 06:33:07,427 INFO L226 Difference]: Without dead ends: 202 [2022-07-20 06:33:07,427 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-20 06:33:07,428 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-20 06:33:07,428 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-20 06:33:07,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-20 06:33:07,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 196. [2022-07-20 06:33:07,432 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-20 06:33:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 255 transitions. [2022-07-20 06:33:07,433 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 255 transitions. Word has length 43 [2022-07-20 06:33:07,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:07,433 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 255 transitions. [2022-07-20 06:33:07,433 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-20 06:33:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 255 transitions. [2022-07-20 06:33:07,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 06:33:07,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:07,434 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-20 06:33:07,443 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-20 06:33:07,634 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-20 06:33:07,635 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:33:07,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:07,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1043867234, now seen corresponding path program 1 times [2022-07-20 06:33:07,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:33:07,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41617108] [2022-07-20 06:33:07,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:07,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:33:07,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:33:07,637 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-20 06:33:07,639 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-20 06:33:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:07,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:33:07,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:07,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:07,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:33:07,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:33:07,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41617108] [2022-07-20 06:33:07,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41617108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:07,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:07,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:33:07,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220290793] [2022-07-20 06:33:07,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:07,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:33:07,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:33:07,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:33:07,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:33:07,809 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-20 06:33:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:07,942 INFO L93 Difference]: Finished difference Result 207 states and 265 transitions. [2022-07-20 06:33:07,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:33:07,942 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-20 06:33:07,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:07,944 INFO L225 Difference]: With dead ends: 207 [2022-07-20 06:33:07,944 INFO L226 Difference]: Without dead ends: 191 [2022-07-20 06:33:07,944 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-20 06:33:07,944 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-20 06:33:07,945 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-20 06:33:07,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-20 06:33:07,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2022-07-20 06:33:07,948 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-20 06:33:07,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 239 transitions. [2022-07-20 06:33:07,949 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 239 transitions. Word has length 43 [2022-07-20 06:33:07,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:07,950 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 239 transitions. [2022-07-20 06:33:07,950 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-20 06:33:07,950 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 239 transitions. [2022-07-20 06:33:07,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 06:33:07,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:07,951 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-20 06:33:07,958 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-20 06:33:08,151 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-20 06:33:08,151 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:33:08,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:08,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1608018874, now seen corresponding path program 1 times [2022-07-20 06:33:08,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:33:08,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635986050] [2022-07-20 06:33:08,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:08,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:33:08,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:33:08,154 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-20 06:33:08,156 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-20 06:33:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:08,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:33:08,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:08,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:08,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:33:08,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:33:08,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635986050] [2022-07-20 06:33:08,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1635986050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:08,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:08,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:33:08,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894014988] [2022-07-20 06:33:08,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:08,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:33:08,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:33:08,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:33:08,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:33:08,318 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-20 06:33:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:08,505 INFO L93 Difference]: Finished difference Result 210 states and 265 transitions. [2022-07-20 06:33:08,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:33:08,506 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-20 06:33:08,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:08,507 INFO L225 Difference]: With dead ends: 210 [2022-07-20 06:33:08,507 INFO L226 Difference]: Without dead ends: 198 [2022-07-20 06:33:08,507 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-20 06:33:08,507 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-20 06:33:08,508 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-20 06:33:08,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-20 06:33:08,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 185. [2022-07-20 06:33:08,513 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-20 06:33:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 238 transitions. [2022-07-20 06:33:08,514 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 238 transitions. Word has length 43 [2022-07-20 06:33:08,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:08,514 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 238 transitions. [2022-07-20 06:33:08,514 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-20 06:33:08,515 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 238 transitions. [2022-07-20 06:33:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 06:33:08,520 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:08,520 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-20 06:33:08,531 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-20 06:33:08,729 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-20 06:33:08,729 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:33:08,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:08,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1614034079, now seen corresponding path program 1 times [2022-07-20 06:33:08,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:33:08,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862520378] [2022-07-20 06:33:08,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:08,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:33:08,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:33:08,732 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-20 06:33:08,734 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-20 06:33:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:08,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 06:33:08,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:08,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:33:08,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:33:08,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862520378] [2022-07-20 06:33:08,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862520378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:08,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:08,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:33:08,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599836565] [2022-07-20 06:33:08,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:08,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:33:08,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:33:08,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:33:08,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:33:08,942 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-20 06:33:09,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:09,084 INFO L93 Difference]: Finished difference Result 211 states and 267 transitions. [2022-07-20 06:33:09,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:33:09,085 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-20 06:33:09,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:09,086 INFO L225 Difference]: With dead ends: 211 [2022-07-20 06:33:09,086 INFO L226 Difference]: Without dead ends: 200 [2022-07-20 06:33:09,086 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-20 06:33:09,087 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 19 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:33:09,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1651 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:33:09,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-20 06:33:09,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 191. [2022-07-20 06:33:09,091 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-20 06:33:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 246 transitions. [2022-07-20 06:33:09,092 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 246 transitions. Word has length 50 [2022-07-20 06:33:09,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:09,092 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 246 transitions. [2022-07-20 06:33:09,092 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-20 06:33:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 246 transitions. [2022-07-20 06:33:09,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 06:33:09,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:09,093 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-20 06:33:09,103 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-20 06:33:09,293 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-20 06:33:09,294 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:33:09,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:09,294 INFO L85 PathProgramCache]: Analyzing trace with hash 27450463, now seen corresponding path program 1 times [2022-07-20 06:33:09,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:33:09,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648870010] [2022-07-20 06:33:09,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:09,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:33:09,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:33:09,297 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-20 06:33:09,299 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-20 06:33:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:09,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 06:33:09,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:09,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:09,497 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:33:09,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:33:09,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648870010] [2022-07-20 06:33:09,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648870010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:09,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:09,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:33:09,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748034996] [2022-07-20 06:33:09,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:09,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:33:09,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:33:09,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:33:09,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:33:09,499 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-20 06:33:09,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:09,637 INFO L93 Difference]: Finished difference Result 200 states and 255 transitions. [2022-07-20 06:33:09,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:33:09,638 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-20 06:33:09,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:09,639 INFO L225 Difference]: With dead ends: 200 [2022-07-20 06:33:09,639 INFO L226 Difference]: Without dead ends: 167 [2022-07-20 06:33:09,639 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-20 06:33:09,640 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-20 06:33:09,640 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-20 06:33:09,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-20 06:33:09,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2022-07-20 06:33:09,643 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-20 06:33:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 198 transitions. [2022-07-20 06:33:09,644 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 198 transitions. Word has length 50 [2022-07-20 06:33:09,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:09,644 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 198 transitions. [2022-07-20 06:33:09,644 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-20 06:33:09,644 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 198 transitions. [2022-07-20 06:33:09,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 06:33:09,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:09,645 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-20 06:33:09,655 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-20 06:33:09,854 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-20 06:33:09,855 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-20 06:33:09,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:09,855 INFO L85 PathProgramCache]: Analyzing trace with hash -825515977, now seen corresponding path program 1 times [2022-07-20 06:33:09,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:33:09,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068350104] [2022-07-20 06:33:09,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:09,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:33:09,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:33:09,857 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-20 06:33:09,858 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-20 06:33:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 06:33:09,924 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 06:33:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 06:33:10,038 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-20 06:33:10,039 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 06:33:10,040 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-07-20 06:33:10,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-07-20 06:33:10,054 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-20 06:33:10,251 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-20 06:33:10,254 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-20 06:33:10,257 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 06:33:10,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 06:33:10 BoogieIcfgContainer [2022-07-20 06:33:10,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 06:33:10,349 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 06:33:10,350 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 06:33:10,350 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 06:33:10,351 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:32:56" (3/4) ... [2022-07-20 06:33:10,353 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-20 06:33:10,354 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 06:33:10,354 INFO L158 Benchmark]: Toolchain (without parser) took 15251.38ms. Allocated memory was 58.7MB in the beginning and 113.2MB in the end (delta: 54.5MB). Free memory was 37.0MB in the beginning and 81.4MB in the end (delta: -44.4MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2022-07-20 06:33:10,354 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 58.7MB. Free memory was 40.9MB in the beginning and 40.9MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 06:33:10,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.23ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 36.8MB in the beginning and 54.0MB in the end (delta: -17.2MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2022-07-20 06:33:10,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.04ms. Allocated memory is still 77.6MB. Free memory was 53.7MB in the beginning and 50.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-20 06:33:10,355 INFO L158 Benchmark]: Boogie Preprocessor took 66.60ms. Allocated memory is still 77.6MB. Free memory was 50.5MB in the beginning and 47.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:33:10,355 INFO L158 Benchmark]: RCFGBuilder took 831.56ms. Allocated memory is still 77.6MB. Free memory was 47.7MB in the beginning and 55.1MB in the end (delta: -7.4MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2022-07-20 06:33:10,355 INFO L158 Benchmark]: TraceAbstraction took 13727.25ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 54.4MB in the beginning and 81.4MB in the end (delta: -27.0MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. [2022-07-20 06:33:10,356 INFO L158 Benchmark]: Witness Printer took 5.01ms. Allocated memory is still 113.2MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 06:33:10,357 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.27ms. Allocated memory is still 58.7MB. Free memory was 40.9MB in the beginning and 40.9MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.23ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 36.8MB in the beginning and 54.0MB in the end (delta: -17.2MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.04ms. Allocated memory is still 77.6MB. Free memory was 53.7MB in the beginning and 50.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.60ms. Allocated memory is still 77.6MB. Free memory was 50.5MB in the beginning and 47.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 831.56ms. Allocated memory is still 77.6MB. Free memory was 47.7MB in the beginning and 55.1MB in the end (delta: -7.4MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13727.25ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 54.4MB in the beginning and 81.4MB in the end (delta: -27.0MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. * Witness Printer took 5.01ms. Allocated memory is still 113.2MB. 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.6s, 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, 21775 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15452 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2305 IncrementalHoareTripleChecker+Invalid, 2482 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 6323 mSDtfsCounter, 2305 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 966 GetRequests, 836 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.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.2s InterpolantComputationTime, 1000 NumberOfCodeBlocks, 1000 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 930 ConstructedInterpolants, 0 QuantifiedInterpolants, 2953 SizeOfPredicates, 65 NumberOfNonLiveVariables, 3475 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-20 06:33:10,398 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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample