./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.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 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:25:38,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:25:38,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:25:38,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:25:38,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:25:38,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:25:38,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:25:38,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:25:38,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:25:38,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:25:38,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:25:38,606 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:25:38,606 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:25:38,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:25:38,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:25:38,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:25:38,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:25:38,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:25:38,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:25:38,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:25:38,620 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:25:38,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:25:38,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:25:38,621 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:25:38,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:25:38,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:25:38,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:25:38,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:25:38,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:25:38,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:25:38,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:25:38,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:25:38,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:25:38,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:25:38,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:25:38,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:25:38,633 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:25:38,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:25:38,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:25:38,634 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:25:38,635 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:25:38,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:25:38,637 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 19:25:38,659 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:25:38,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:25:38,659 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:25:38,659 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:25:38,660 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:25:38,660 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:25:38,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:25:38,661 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:25:38,661 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:25:38,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:25:38,662 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:25:38,662 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:25:38,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:25:38,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:25:38,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:25:38,662 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:25:38,662 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:25:38,663 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:25:38,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:25:38,663 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:25:38,664 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:25:38,664 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:25:38,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:25:38,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:25:38,664 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:25:38,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:25:38,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:25:38,665 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:25:38,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 19:25:38,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 19:25:38,665 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 -> 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c [2022-07-12 19:25:38,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:25:38,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:25:38,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:25:38,898 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:25:38,898 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:25:38,900 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2022-07-12 19:25:38,948 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d19551319/fd62b06a033c491db926ef4ead58bfa2/FLAG0289b942f [2022-07-12 19:25:39,380 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:25:39,383 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2022-07-12 19:25:39,398 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d19551319/fd62b06a033c491db926ef4ead58bfa2/FLAG0289b942f [2022-07-12 19:25:39,411 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d19551319/fd62b06a033c491db926ef4ead58bfa2 [2022-07-12 19:25:39,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:25:39,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:25:39,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:25:39,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:25:39,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:25:39,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:25:39" (1/1) ... [2022-07-12 19:25:39,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c1380ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:25:39, skipping insertion in model container [2022-07-12 19:25:39,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:25:39" (1/1) ... [2022-07-12 19:25:39,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:25:39,462 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:25:39,617 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/diskperf_simpl1.cil.c[2072,2085] [2022-07-12 19:25:39,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:25:39,719 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:25:39,738 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/diskperf_simpl1.cil.c[2072,2085] [2022-07-12 19:25:39,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:25:39,786 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:25:39,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:25:39 WrapperNode [2022-07-12 19:25:39,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:25:39,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:25:39,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:25:39,788 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:25:39,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:25:39" (1/1) ... [2022-07-12 19:25:39,806 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:25:39" (1/1) ... [2022-07-12 19:25:39,845 INFO L137 Inliner]: procedures = 38, calls = 66, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 755 [2022-07-12 19:25:39,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:25:39,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:25:39,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:25:39,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:25:39,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:25:39" (1/1) ... [2022-07-12 19:25:39,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:25:39" (1/1) ... [2022-07-12 19:25:39,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:25:39" (1/1) ... [2022-07-12 19:25:39,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:25:39" (1/1) ... [2022-07-12 19:25:39,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:25:39" (1/1) ... [2022-07-12 19:25:39,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:25:39" (1/1) ... [2022-07-12 19:25:39,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:25:39" (1/1) ... [2022-07-12 19:25:39,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:25:39,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:25:39,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:25:39,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:25:39,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:25:39" (1/1) ... [2022-07-12 19:25:39,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:25:39,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:25:39,944 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 19:25:39,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 19:25:39,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:25:39,979 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-12 19:25:39,979 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-12 19:25:39,979 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-07-12 19:25:39,979 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-07-12 19:25:39,979 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-12 19:25:39,980 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-12 19:25:39,980 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-07-12 19:25:39,980 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-07-12 19:25:39,981 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2022-07-12 19:25:39,984 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2022-07-12 19:25:39,984 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-12 19:25:39,985 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-12 19:25:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 19:25:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-12 19:25:39,985 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-12 19:25:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2022-07-12 19:25:39,985 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2022-07-12 19:25:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2022-07-12 19:25:39,985 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2022-07-12 19:25:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:25:39,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:25:40,144 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:25:40,146 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:25:40,150 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:25:40,201 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-07-12 19:25:40,202 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-07-12 19:25:40,203 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:25:40,220 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-07-12 19:25:40,221 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-07-12 19:25:40,255 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:25:40,260 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:25:40,285 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:25:40,564 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume !false; [2022-07-12 19:25:40,565 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume false; [2022-07-12 19:25:40,565 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-07-12 19:25:40,565 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-07-12 19:25:40,565 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2022-07-12 19:25:40,565 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2022-07-12 19:25:40,566 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:25:40,596 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-07-12 19:25:40,597 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-07-12 19:25:40,624 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:25:40,629 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:25:40,630 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 19:25:40,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:25:40 BoogieIcfgContainer [2022-07-12 19:25:40,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:25:40,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:25:40,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:25:40,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:25:40,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:25:39" (1/3) ... [2022-07-12 19:25:40,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488e15e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:25:40, skipping insertion in model container [2022-07-12 19:25:40,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:25:39" (2/3) ... [2022-07-12 19:25:40,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488e15e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:25:40, skipping insertion in model container [2022-07-12 19:25:40,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:25:40" (3/3) ... [2022-07-12 19:25:40,640 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2022-07-12 19:25:40,650 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:25:40,651 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 19:25:40,690 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:25:40,694 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@4fd56019, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@65bedfe3 [2022-07-12 19:25:40,695 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-12 19:25:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 244 states, 188 states have (on average 1.4734042553191489) internal successors, (277), 206 states have internal predecessors, (277), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2022-07-12 19:25:40,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 19:25:40,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:40,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:40,707 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:40,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:40,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1705481022, now seen corresponding path program 1 times [2022-07-12 19:25:40,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:40,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272159619] [2022-07-12 19:25:40,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:40,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:40,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:40,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272159619] [2022-07-12 19:25:40,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272159619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:40,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:40,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:25:40,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683090361] [2022-07-12 19:25:40,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:40,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:25:40,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:40,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:25:40,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:40,898 INFO L87 Difference]: Start difference. First operand has 244 states, 188 states have (on average 1.4734042553191489) internal successors, (277), 206 states have internal predecessors, (277), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:41,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:41,023 INFO L93 Difference]: Finished difference Result 417 states and 600 transitions. [2022-07-12 19:25:41,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:25:41,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 19:25:41,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:41,034 INFO L225 Difference]: With dead ends: 417 [2022-07-12 19:25:41,038 INFO L226 Difference]: Without dead ends: 413 [2022-07-12 19:25:41,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:41,042 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 328 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:41,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 619 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:25:41,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-07-12 19:25:41,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 397. [2022-07-12 19:25:41,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 316 states have (on average 1.4398734177215189) internal successors, (455), 328 states have internal predecessors, (455), 63 states have call successors, (63), 16 states have call predecessors, (63), 16 states have return successors, (61), 56 states have call predecessors, (61), 49 states have call successors, (61) [2022-07-12 19:25:41,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 579 transitions. [2022-07-12 19:25:41,115 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 579 transitions. Word has length 8 [2022-07-12 19:25:41,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:41,115 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 579 transitions. [2022-07-12 19:25:41,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 579 transitions. [2022-07-12 19:25:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 19:25:41,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:41,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:41,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 19:25:41,117 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:41,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:41,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1322410939, now seen corresponding path program 1 times [2022-07-12 19:25:41,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:41,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944552466] [2022-07-12 19:25:41,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:41,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:41,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:41,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944552466] [2022-07-12 19:25:41,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944552466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:41,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:41,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:25:41,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398607676] [2022-07-12 19:25:41,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:41,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:25:41,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:41,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:25:41,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:41,174 INFO L87 Difference]: Start difference. First operand 397 states and 579 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:41,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:41,232 INFO L93 Difference]: Finished difference Result 396 states and 578 transitions. [2022-07-12 19:25:41,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:25:41,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-07-12 19:25:41,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:41,236 INFO L225 Difference]: With dead ends: 396 [2022-07-12 19:25:41,237 INFO L226 Difference]: Without dead ends: 393 [2022-07-12 19:25:41,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:41,239 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 173 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:41,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 450 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:25:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-07-12 19:25:41,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2022-07-12 19:25:41,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 313 states have (on average 1.4089456869009584) internal successors, (441), 324 states have internal predecessors, (441), 63 states have call successors, (63), 16 states have call predecessors, (63), 16 states have return successors, (61), 56 states have call predecessors, (61), 49 states have call successors, (61) [2022-07-12 19:25:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 565 transitions. [2022-07-12 19:25:41,269 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 565 transitions. Word has length 9 [2022-07-12 19:25:41,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:41,269 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 565 transitions. [2022-07-12 19:25:41,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:41,270 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 565 transitions. [2022-07-12 19:25:41,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 19:25:41,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:41,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:41,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 19:25:41,271 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:41,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:41,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1925745618, now seen corresponding path program 1 times [2022-07-12 19:25:41,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:41,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945916806] [2022-07-12 19:25:41,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:41,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:41,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:41,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945916806] [2022-07-12 19:25:41,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945916806] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:41,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:41,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:25:41,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702035665] [2022-07-12 19:25:41,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:41,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:25:41,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:41,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:25:41,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:41,305 INFO L87 Difference]: Start difference. First operand 393 states and 565 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:41,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:41,347 INFO L93 Difference]: Finished difference Result 396 states and 567 transitions. [2022-07-12 19:25:41,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:25:41,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2022-07-12 19:25:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:41,350 INFO L225 Difference]: With dead ends: 396 [2022-07-12 19:25:41,350 INFO L226 Difference]: Without dead ends: 393 [2022-07-12 19:25:41,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:41,351 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 0 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:41,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 617 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:25:41,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-07-12 19:25:41,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2022-07-12 19:25:41,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 313 states have (on average 1.4057507987220448) internal successors, (440), 324 states have internal predecessors, (440), 63 states have call successors, (63), 16 states have call predecessors, (63), 16 states have return successors, (61), 56 states have call predecessors, (61), 49 states have call successors, (61) [2022-07-12 19:25:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 564 transitions. [2022-07-12 19:25:41,373 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 564 transitions. Word has length 13 [2022-07-12 19:25:41,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:41,373 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 564 transitions. [2022-07-12 19:25:41,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 564 transitions. [2022-07-12 19:25:41,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 19:25:41,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:41,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:41,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 19:25:41,376 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:41,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:41,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1077867276, now seen corresponding path program 1 times [2022-07-12 19:25:41,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:41,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66777460] [2022-07-12 19:25:41,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:41,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:41,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:41,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:41,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66777460] [2022-07-12 19:25:41,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66777460] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:41,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:41,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:25:41,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674021326] [2022-07-12 19:25:41,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:41,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:25:41,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:41,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:25:41,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:41,426 INFO L87 Difference]: Start difference. First operand 393 states and 564 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:41,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:41,522 INFO L93 Difference]: Finished difference Result 666 states and 990 transitions. [2022-07-12 19:25:41,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:25:41,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 19:25:41,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:41,526 INFO L225 Difference]: With dead ends: 666 [2022-07-12 19:25:41,526 INFO L226 Difference]: Without dead ends: 665 [2022-07-12 19:25:41,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:41,527 INFO L413 NwaCegarLoop]: 457 mSDtfsCounter, 250 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:41,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 682 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:25:41,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-07-12 19:25:41,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 625. [2022-07-12 19:25:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 500 states have (on average 1.392) internal successors, (696), 503 states have internal predecessors, (696), 96 states have call successors, (96), 30 states have call predecessors, (96), 28 states have return successors, (148), 95 states have call predecessors, (148), 85 states have call successors, (148) [2022-07-12 19:25:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 940 transitions. [2022-07-12 19:25:41,550 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 940 transitions. Word has length 15 [2022-07-12 19:25:41,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:41,550 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 940 transitions. [2022-07-12 19:25:41,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:41,551 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 940 transitions. [2022-07-12 19:25:41,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 19:25:41,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:41,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:41,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 19:25:41,552 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:41,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:41,552 INFO L85 PathProgramCache]: Analyzing trace with hash -291957618, now seen corresponding path program 1 times [2022-07-12 19:25:41,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:41,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121564377] [2022-07-12 19:25:41,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:41,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:41,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:41,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:41,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121564377] [2022-07-12 19:25:41,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121564377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:41,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:41,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:25:41,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213294413] [2022-07-12 19:25:41,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:41,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:25:41,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:41,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:25:41,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:41,630 INFO L87 Difference]: Start difference. First operand 625 states and 940 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:41,662 INFO L93 Difference]: Finished difference Result 949 states and 1438 transitions. [2022-07-12 19:25:41,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:25:41,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-12 19:25:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:41,671 INFO L225 Difference]: With dead ends: 949 [2022-07-12 19:25:41,671 INFO L226 Difference]: Without dead ends: 949 [2022-07-12 19:25:41,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:41,676 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 255 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:41,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 585 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:25:41,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2022-07-12 19:25:41,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 904. [2022-07-12 19:25:41,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 717 states have (on average 1.407252440725244) internal successors, (1009), 722 states have internal predecessors, (1009), 142 states have call successors, (142), 46 states have call predecessors, (142), 44 states have return successors, (231), 137 states have call predecessors, (231), 132 states have call successors, (231) [2022-07-12 19:25:41,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1382 transitions. [2022-07-12 19:25:41,722 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1382 transitions. Word has length 20 [2022-07-12 19:25:41,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:41,722 INFO L495 AbstractCegarLoop]: Abstraction has 904 states and 1382 transitions. [2022-07-12 19:25:41,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1382 transitions. [2022-07-12 19:25:41,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 19:25:41,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:41,727 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] [2022-07-12 19:25:41,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 19:25:41,727 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:41,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:41,727 INFO L85 PathProgramCache]: Analyzing trace with hash -175921107, now seen corresponding path program 1 times [2022-07-12 19:25:41,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:41,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653427795] [2022-07-12 19:25:41,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:41,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:41,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-12 19:25:41,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:41,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653427795] [2022-07-12 19:25:41,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653427795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:41,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:41,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:25:41,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68460272] [2022-07-12 19:25:41,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:41,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:25:41,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:41,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:25:41,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:41,784 INFO L87 Difference]: Start difference. First operand 904 states and 1382 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:41,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:41,831 INFO L93 Difference]: Finished difference Result 915 states and 1397 transitions. [2022-07-12 19:25:41,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:25:41,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 24 [2022-07-12 19:25:41,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:41,835 INFO L225 Difference]: With dead ends: 915 [2022-07-12 19:25:41,835 INFO L226 Difference]: Without dead ends: 915 [2022-07-12 19:25:41,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:41,837 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 21 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:41,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 557 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:25:41,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2022-07-12 19:25:41,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 914. [2022-07-12 19:25:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 728 states have (on average 1.4052197802197801) internal successors, (1023), 731 states have internal predecessors, (1023), 141 states have call successors, (141), 47 states have call predecessors, (141), 44 states have return successors, (231), 137 states have call predecessors, (231), 132 states have call successors, (231) [2022-07-12 19:25:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1395 transitions. [2022-07-12 19:25:41,862 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1395 transitions. Word has length 24 [2022-07-12 19:25:41,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:41,863 INFO L495 AbstractCegarLoop]: Abstraction has 914 states and 1395 transitions. [2022-07-12 19:25:41,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:41,863 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1395 transitions. [2022-07-12 19:25:41,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 19:25:41,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:41,864 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] [2022-07-12 19:25:41,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 19:25:41,865 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:41,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:41,865 INFO L85 PathProgramCache]: Analyzing trace with hash 9760830, now seen corresponding path program 1 times [2022-07-12 19:25:41,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:41,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572810818] [2022-07-12 19:25:41,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:41,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:41,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 19:25:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:41,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:41,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:41,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572810818] [2022-07-12 19:25:41,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572810818] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:41,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:41,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:25:41,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115794715] [2022-07-12 19:25:41,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:41,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:25:41,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:41,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:25:41,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:25:41,926 INFO L87 Difference]: Start difference. First operand 914 states and 1395 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:42,074 INFO L93 Difference]: Finished difference Result 974 states and 1486 transitions. [2022-07-12 19:25:42,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:25:42,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-07-12 19:25:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:42,078 INFO L225 Difference]: With dead ends: 974 [2022-07-12 19:25:42,078 INFO L226 Difference]: Without dead ends: 974 [2022-07-12 19:25:42,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:25:42,079 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 100 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:42,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 673 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:25:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2022-07-12 19:25:42,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 951. [2022-07-12 19:25:42,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 761 states have (on average 1.3955321944809462) internal successors, (1062), 768 states have internal predecessors, (1062), 141 states have call successors, (141), 47 states have call predecessors, (141), 48 states have return successors, (249), 137 states have call predecessors, (249), 132 states have call successors, (249) [2022-07-12 19:25:42,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1452 transitions. [2022-07-12 19:25:42,106 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1452 transitions. Word has length 27 [2022-07-12 19:25:42,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:42,107 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1452 transitions. [2022-07-12 19:25:42,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:42,107 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1452 transitions. [2022-07-12 19:25:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 19:25:42,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:42,108 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] [2022-07-12 19:25:42,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 19:25:42,108 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:42,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:42,108 INFO L85 PathProgramCache]: Analyzing trace with hash 755665447, now seen corresponding path program 1 times [2022-07-12 19:25:42,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:42,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655280930] [2022-07-12 19:25:42,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:42,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:42,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 19:25:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:42,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:42,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:42,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655280930] [2022-07-12 19:25:42,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655280930] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:42,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:42,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:25:42,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856977690] [2022-07-12 19:25:42,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:42,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:25:42,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:42,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:25:42,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:25:42,168 INFO L87 Difference]: Start difference. First operand 951 states and 1452 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:42,393 INFO L93 Difference]: Finished difference Result 974 states and 1484 transitions. [2022-07-12 19:25:42,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:25:42,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 28 [2022-07-12 19:25:42,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:42,397 INFO L225 Difference]: With dead ends: 974 [2022-07-12 19:25:42,398 INFO L226 Difference]: Without dead ends: 974 [2022-07-12 19:25:42,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:25:42,398 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 403 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:42,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 790 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:42,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2022-07-12 19:25:42,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 951. [2022-07-12 19:25:42,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 761 states have (on average 1.392904073587385) internal successors, (1060), 768 states have internal predecessors, (1060), 141 states have call successors, (141), 47 states have call predecessors, (141), 48 states have return successors, (249), 137 states have call predecessors, (249), 132 states have call successors, (249) [2022-07-12 19:25:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1450 transitions. [2022-07-12 19:25:42,419 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1450 transitions. Word has length 28 [2022-07-12 19:25:42,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:42,419 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1450 transitions. [2022-07-12 19:25:42,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:42,419 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1450 transitions. [2022-07-12 19:25:42,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 19:25:42,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:42,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:42,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 19:25:42,420 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:42,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:42,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1062018506, now seen corresponding path program 1 times [2022-07-12 19:25:42,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:42,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222562675] [2022-07-12 19:25:42,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:42,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:42,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 19:25:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:42,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:42,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222562675] [2022-07-12 19:25:42,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222562675] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:42,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:42,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:25:42,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040424547] [2022-07-12 19:25:42,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:42,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:25:42,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:42,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:25:42,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:25:42,492 INFO L87 Difference]: Start difference. First operand 951 states and 1450 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:42,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:42,769 INFO L93 Difference]: Finished difference Result 974 states and 1482 transitions. [2022-07-12 19:25:42,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:25:42,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 29 [2022-07-12 19:25:42,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:42,773 INFO L225 Difference]: With dead ends: 974 [2022-07-12 19:25:42,773 INFO L226 Difference]: Without dead ends: 974 [2022-07-12 19:25:42,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:25:42,775 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 401 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:42,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 791 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:42,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2022-07-12 19:25:42,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 951. [2022-07-12 19:25:42,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 761 states have (on average 1.390275952693824) internal successors, (1058), 768 states have internal predecessors, (1058), 141 states have call successors, (141), 47 states have call predecessors, (141), 48 states have return successors, (249), 137 states have call predecessors, (249), 132 states have call successors, (249) [2022-07-12 19:25:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1448 transitions. [2022-07-12 19:25:42,797 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1448 transitions. Word has length 29 [2022-07-12 19:25:42,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:42,798 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1448 transitions. [2022-07-12 19:25:42,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1448 transitions. [2022-07-12 19:25:42,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 19:25:42,800 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:42,800 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] [2022-07-12 19:25:42,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 19:25:42,801 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:42,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:42,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1381771216, now seen corresponding path program 1 times [2022-07-12 19:25:42,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:42,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496483108] [2022-07-12 19:25:42,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:42,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:42,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 19:25:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:42,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:42,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:42,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496483108] [2022-07-12 19:25:42,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496483108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:42,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:42,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:25:42,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878189702] [2022-07-12 19:25:42,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:42,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:25:42,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:42,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:25:42,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:25:42,847 INFO L87 Difference]: Start difference. First operand 951 states and 1448 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:42,996 INFO L93 Difference]: Finished difference Result 984 states and 1493 transitions. [2022-07-12 19:25:42,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:25:42,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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 30 [2022-07-12 19:25:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:43,000 INFO L225 Difference]: With dead ends: 984 [2022-07-12 19:25:43,001 INFO L226 Difference]: Without dead ends: 968 [2022-07-12 19:25:43,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:25:43,002 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 84 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:43,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 998 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:25:43,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2022-07-12 19:25:43,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 947. [2022-07-12 19:25:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 758 states have (on average 1.3905013192612137) internal successors, (1054), 765 states have internal predecessors, (1054), 140 states have call successors, (140), 47 states have call predecessors, (140), 48 states have return successors, (248), 136 states have call predecessors, (248), 131 states have call successors, (248) [2022-07-12 19:25:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1442 transitions. [2022-07-12 19:25:43,025 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1442 transitions. Word has length 30 [2022-07-12 19:25:43,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:43,025 INFO L495 AbstractCegarLoop]: Abstraction has 947 states and 1442 transitions. [2022-07-12 19:25:43,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1442 transitions. [2022-07-12 19:25:43,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:25:43,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:43,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:43,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 19:25:43,026 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:43,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:43,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1269800431, now seen corresponding path program 1 times [2022-07-12 19:25:43,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:43,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758772643] [2022-07-12 19:25:43,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:43,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:43,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 19:25:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:43,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:43,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:43,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758772643] [2022-07-12 19:25:43,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758772643] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:43,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:43,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:25:43,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717535919] [2022-07-12 19:25:43,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:43,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:25:43,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:43,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:25:43,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:25:43,097 INFO L87 Difference]: Start difference. First operand 947 states and 1442 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:43,300 INFO L93 Difference]: Finished difference Result 997 states and 1505 transitions. [2022-07-12 19:25:43,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:25:43,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-07-12 19:25:43,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:43,305 INFO L225 Difference]: With dead ends: 997 [2022-07-12 19:25:43,305 INFO L226 Difference]: Without dead ends: 966 [2022-07-12 19:25:43,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:25:43,306 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 113 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:43,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1228 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:43,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-07-12 19:25:43,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 945. [2022-07-12 19:25:43,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 757 states have (on average 1.3883751651254954) internal successors, (1051), 764 states have internal predecessors, (1051), 139 states have call successors, (139), 47 states have call predecessors, (139), 48 states have return successors, (247), 135 states have call predecessors, (247), 130 states have call successors, (247) [2022-07-12 19:25:43,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1437 transitions. [2022-07-12 19:25:43,328 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1437 transitions. Word has length 34 [2022-07-12 19:25:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:43,329 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1437 transitions. [2022-07-12 19:25:43,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:43,329 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1437 transitions. [2022-07-12 19:25:43,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:25:43,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:43,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:43,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 19:25:43,331 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:43,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:43,332 INFO L85 PathProgramCache]: Analyzing trace with hash 282504272, now seen corresponding path program 1 times [2022-07-12 19:25:43,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:43,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546470359] [2022-07-12 19:25:43,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:43,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:43,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:25:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:43,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:43,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:43,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546470359] [2022-07-12 19:25:43,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546470359] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:43,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:43,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:25:43,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396493462] [2022-07-12 19:25:43,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:43,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:25:43,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:43,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:25:43,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:25:43,392 INFO L87 Difference]: Start difference. First operand 945 states and 1437 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:43,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:43,654 INFO L93 Difference]: Finished difference Result 1436 states and 2280 transitions. [2022-07-12 19:25:43,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:25:43,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-07-12 19:25:43,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:43,660 INFO L225 Difference]: With dead ends: 1436 [2022-07-12 19:25:43,660 INFO L226 Difference]: Without dead ends: 1436 [2022-07-12 19:25:43,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:25:43,661 INFO L413 NwaCegarLoop]: 353 mSDtfsCounter, 276 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:43,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 736 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2022-07-12 19:25:43,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1012. [2022-07-12 19:25:43,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 811 states have (on average 1.3834771886559802) internal successors, (1122), 821 states have internal predecessors, (1122), 146 states have call successors, (146), 49 states have call predecessors, (146), 54 states have return successors, (276), 143 states have call predecessors, (276), 137 states have call successors, (276) [2022-07-12 19:25:43,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1544 transitions. [2022-07-12 19:25:43,689 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1544 transitions. Word has length 34 [2022-07-12 19:25:43,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:43,689 INFO L495 AbstractCegarLoop]: Abstraction has 1012 states and 1544 transitions. [2022-07-12 19:25:43,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1544 transitions. [2022-07-12 19:25:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 19:25:43,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:43,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:43,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 19:25:43,690 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:43,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:43,690 INFO L85 PathProgramCache]: Analyzing trace with hash 621054387, now seen corresponding path program 1 times [2022-07-12 19:25:43,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:43,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743574381] [2022-07-12 19:25:43,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:43,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:43,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:25:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:43,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:43,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743574381] [2022-07-12 19:25:43,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743574381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:43,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:43,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:25:43,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598437924] [2022-07-12 19:25:43,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:43,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:25:43,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:43,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:25:43,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:25:43,746 INFO L87 Difference]: Start difference. First operand 1012 states and 1544 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:44,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:44,078 INFO L93 Difference]: Finished difference Result 1074 states and 1632 transitions. [2022-07-12 19:25:44,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:25:44,079 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-07-12 19:25:44,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:44,084 INFO L225 Difference]: With dead ends: 1074 [2022-07-12 19:25:44,084 INFO L226 Difference]: Without dead ends: 1073 [2022-07-12 19:25:44,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:25:44,085 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 87 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:44,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1563 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:25:44,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2022-07-12 19:25:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1020. [2022-07-12 19:25:44,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 819 states have (on average 1.3821733821733821) internal successors, (1132), 829 states have internal predecessors, (1132), 146 states have call successors, (146), 49 states have call predecessors, (146), 54 states have return successors, (276), 143 states have call predecessors, (276), 137 states have call successors, (276) [2022-07-12 19:25:44,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1554 transitions. [2022-07-12 19:25:44,109 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1554 transitions. Word has length 35 [2022-07-12 19:25:44,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:44,109 INFO L495 AbstractCegarLoop]: Abstraction has 1020 states and 1554 transitions. [2022-07-12 19:25:44,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:44,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1554 transitions. [2022-07-12 19:25:44,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 19:25:44,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:44,111 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:44,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 19:25:44,111 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:44,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:44,111 INFO L85 PathProgramCache]: Analyzing trace with hash 620777557, now seen corresponding path program 1 times [2022-07-12 19:25:44,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:44,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82643276] [2022-07-12 19:25:44,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:44,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:44,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:25:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:44,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:44,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:44,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82643276] [2022-07-12 19:25:44,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82643276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:44,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:44,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:25:44,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273231693] [2022-07-12 19:25:44,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:44,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:25:44,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:44,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:25:44,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:25:44,186 INFO L87 Difference]: Start difference. First operand 1020 states and 1554 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:44,476 INFO L93 Difference]: Finished difference Result 1147 states and 1834 transitions. [2022-07-12 19:25:44,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:25:44,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-07-12 19:25:44,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:44,481 INFO L225 Difference]: With dead ends: 1147 [2022-07-12 19:25:44,482 INFO L226 Difference]: Without dead ends: 1134 [2022-07-12 19:25:44,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:25:44,482 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 96 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:44,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1679 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:44,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2022-07-12 19:25:44,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1038. [2022-07-12 19:25:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 836 states have (on average 1.3863636363636365) internal successors, (1159), 847 states have internal predecessors, (1159), 146 states have call successors, (146), 49 states have call predecessors, (146), 55 states have return successors, (295), 143 states have call predecessors, (295), 137 states have call successors, (295) [2022-07-12 19:25:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1600 transitions. [2022-07-12 19:25:44,507 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1600 transitions. Word has length 35 [2022-07-12 19:25:44,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:44,507 INFO L495 AbstractCegarLoop]: Abstraction has 1038 states and 1600 transitions. [2022-07-12 19:25:44,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1600 transitions. [2022-07-12 19:25:44,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:25:44,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:44,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:44,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 19:25:44,509 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:44,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:44,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1299938929, now seen corresponding path program 1 times [2022-07-12 19:25:44,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:44,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520188667] [2022-07-12 19:25:44,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:44,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:44,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:44,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520188667] [2022-07-12 19:25:44,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520188667] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:44,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:44,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:25:44,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775067540] [2022-07-12 19:25:44,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:44,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:25:44,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:44,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:25:44,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:25:44,535 INFO L87 Difference]: Start difference. First operand 1038 states and 1600 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:44,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:44,634 INFO L93 Difference]: Finished difference Result 1047 states and 1605 transitions. [2022-07-12 19:25:44,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:25:44,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 19:25:44,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:44,661 INFO L225 Difference]: With dead ends: 1047 [2022-07-12 19:25:44,662 INFO L226 Difference]: Without dead ends: 1047 [2022-07-12 19:25:44,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:25:44,664 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 312 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:44,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 470 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:25:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2022-07-12 19:25:44,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1032. [2022-07-12 19:25:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 830 states have (on average 1.3855421686746987) internal successors, (1150), 842 states have internal predecessors, (1150), 146 states have call successors, (146), 49 states have call predecessors, (146), 55 states have return successors, (293), 142 states have call predecessors, (293), 137 states have call successors, (293) [2022-07-12 19:25:44,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1589 transitions. [2022-07-12 19:25:44,684 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1589 transitions. Word has length 34 [2022-07-12 19:25:44,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:44,685 INFO L495 AbstractCegarLoop]: Abstraction has 1032 states and 1589 transitions. [2022-07-12 19:25:44,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:44,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1589 transitions. [2022-07-12 19:25:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 19:25:44,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:44,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:44,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 19:25:44,686 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:44,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:44,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2068890717, now seen corresponding path program 1 times [2022-07-12 19:25:44,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:44,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351413766] [2022-07-12 19:25:44,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:44,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:44,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:25:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:44,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:44,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:44,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351413766] [2022-07-12 19:25:44,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351413766] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:44,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:44,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:25:44,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245448089] [2022-07-12 19:25:44,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:44,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:25:44,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:44,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:25:44,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:25:44,751 INFO L87 Difference]: Start difference. First operand 1032 states and 1589 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:45,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:45,217 INFO L93 Difference]: Finished difference Result 1482 states and 2371 transitions. [2022-07-12 19:25:45,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:25:45,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 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 36 [2022-07-12 19:25:45,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:45,223 INFO L225 Difference]: With dead ends: 1482 [2022-07-12 19:25:45,223 INFO L226 Difference]: Without dead ends: 1469 [2022-07-12 19:25:45,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:25:45,224 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 758 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:45,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 841 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:25:45,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2022-07-12 19:25:45,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1019. [2022-07-12 19:25:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 819 states have (on average 1.387057387057387) internal successors, (1136), 830 states have internal predecessors, (1136), 145 states have call successors, (145), 49 states have call predecessors, (145), 54 states have return successors, (274), 141 states have call predecessors, (274), 136 states have call successors, (274) [2022-07-12 19:25:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1555 transitions. [2022-07-12 19:25:45,254 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1555 transitions. Word has length 36 [2022-07-12 19:25:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:45,254 INFO L495 AbstractCegarLoop]: Abstraction has 1019 states and 1555 transitions. [2022-07-12 19:25:45,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1555 transitions. [2022-07-12 19:25:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 19:25:45,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:45,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:45,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 19:25:45,256 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:45,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:45,256 INFO L85 PathProgramCache]: Analyzing trace with hash 661355935, now seen corresponding path program 1 times [2022-07-12 19:25:45,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:45,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7778380] [2022-07-12 19:25:45,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:45,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:45,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 19:25:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:45,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:45,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7778380] [2022-07-12 19:25:45,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7778380] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:45,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:45,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:25:45,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733962660] [2022-07-12 19:25:45,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:45,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:25:45,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:45,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:25:45,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:25:45,293 INFO L87 Difference]: Start difference. First operand 1019 states and 1555 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:45,487 INFO L93 Difference]: Finished difference Result 723 states and 1044 transitions. [2022-07-12 19:25:45,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:25:45,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-07-12 19:25:45,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:45,490 INFO L225 Difference]: With dead ends: 723 [2022-07-12 19:25:45,491 INFO L226 Difference]: Without dead ends: 723 [2022-07-12 19:25:45,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:25:45,491 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 378 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:45,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 714 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:45,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-07-12 19:25:45,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 650. [2022-07-12 19:25:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 527 states have (on average 1.3529411764705883) internal successors, (713), 537 states have internal predecessors, (713), 87 states have call successors, (87), 33 states have call predecessors, (87), 35 states have return successors, (143), 81 states have call predecessors, (143), 78 states have call successors, (143) [2022-07-12 19:25:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 943 transitions. [2022-07-12 19:25:45,505 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 943 transitions. Word has length 38 [2022-07-12 19:25:45,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:45,505 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 943 transitions. [2022-07-12 19:25:45,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:45,505 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 943 transitions. [2022-07-12 19:25:45,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 19:25:45,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:45,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:45,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 19:25:45,506 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:45,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:45,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1922765743, now seen corresponding path program 1 times [2022-07-12 19:25:45,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:45,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352709] [2022-07-12 19:25:45,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:45,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:45,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:45,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352709] [2022-07-12 19:25:45,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352709] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:45,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:45,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:25:45,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774673603] [2022-07-12 19:25:45,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:45,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:25:45,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:45,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:25:45,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:45,533 INFO L87 Difference]: Start difference. First operand 650 states and 943 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:45,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:45,588 INFO L93 Difference]: Finished difference Result 916 states and 1387 transitions. [2022-07-12 19:25:45,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:25:45,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 35 [2022-07-12 19:25:45,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:45,591 INFO L225 Difference]: With dead ends: 916 [2022-07-12 19:25:45,591 INFO L226 Difference]: Without dead ends: 916 [2022-07-12 19:25:45,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:45,592 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 183 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:45,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 715 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:25:45,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2022-07-12 19:25:45,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 666. [2022-07-12 19:25:45,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 542 states have (on average 1.345018450184502) internal successors, (729), 552 states have internal predecessors, (729), 87 states have call successors, (87), 33 states have call predecessors, (87), 36 states have return successors, (144), 82 states have call predecessors, (144), 78 states have call successors, (144) [2022-07-12 19:25:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 960 transitions. [2022-07-12 19:25:45,608 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 960 transitions. Word has length 35 [2022-07-12 19:25:45,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:45,608 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 960 transitions. [2022-07-12 19:25:45,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:45,608 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 960 transitions. [2022-07-12 19:25:45,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 19:25:45,609 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:45,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:45,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 19:25:45,609 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:45,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:45,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1798212433, now seen corresponding path program 1 times [2022-07-12 19:25:45,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:45,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949991125] [2022-07-12 19:25:45,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:45,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:45,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:45,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:45,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949991125] [2022-07-12 19:25:45,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949991125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:45,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:45,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:25:45,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479408087] [2022-07-12 19:25:45,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:45,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:25:45,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:45,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:25:45,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:25:45,650 INFO L87 Difference]: Start difference. First operand 666 states and 960 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:45,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:45,729 INFO L93 Difference]: Finished difference Result 644 states and 929 transitions. [2022-07-12 19:25:45,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:25:45,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 35 [2022-07-12 19:25:45,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:45,732 INFO L225 Difference]: With dead ends: 644 [2022-07-12 19:25:45,732 INFO L226 Difference]: Without dead ends: 644 [2022-07-12 19:25:45,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:25:45,733 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 291 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:45,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 463 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:25:45,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-07-12 19:25:45,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 642. [2022-07-12 19:25:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 520 states have (on average 1.3423076923076922) internal successors, (698), 529 states have internal predecessors, (698), 86 states have call successors, (86), 33 states have call predecessors, (86), 35 states have return successors, (143), 81 states have call predecessors, (143), 78 states have call successors, (143) [2022-07-12 19:25:45,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 927 transitions. [2022-07-12 19:25:45,745 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 927 transitions. Word has length 35 [2022-07-12 19:25:45,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:45,746 INFO L495 AbstractCegarLoop]: Abstraction has 642 states and 927 transitions. [2022-07-12 19:25:45,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:45,746 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 927 transitions. [2022-07-12 19:25:45,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:25:45,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:45,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:45,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 19:25:45,747 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:45,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:45,747 INFO L85 PathProgramCache]: Analyzing trace with hash 734679029, now seen corresponding path program 1 times [2022-07-12 19:25:45,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:45,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727119160] [2022-07-12 19:25:45,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:45,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:45,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 19:25:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:45,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:45,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727119160] [2022-07-12 19:25:45,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727119160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:45,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:45,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:25:45,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750585662] [2022-07-12 19:25:45,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:45,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:25:45,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:45,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:25:45,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:25:45,795 INFO L87 Difference]: Start difference. First operand 642 states and 927 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:46,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:46,077 INFO L93 Difference]: Finished difference Result 698 states and 1010 transitions. [2022-07-12 19:25:46,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:25:46,077 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 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 37 [2022-07-12 19:25:46,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:46,080 INFO L225 Difference]: With dead ends: 698 [2022-07-12 19:25:46,080 INFO L226 Difference]: Without dead ends: 670 [2022-07-12 19:25:46,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:25:46,080 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 83 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:46,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1519 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:46,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-07-12 19:25:46,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 615. [2022-07-12 19:25:46,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 495 states have (on average 1.3494949494949495) internal successors, (668), 504 states have internal predecessors, (668), 85 states have call successors, (85), 32 states have call predecessors, (85), 34 states have return successors, (142), 80 states have call predecessors, (142), 77 states have call successors, (142) [2022-07-12 19:25:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 895 transitions. [2022-07-12 19:25:46,093 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 895 transitions. Word has length 37 [2022-07-12 19:25:46,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:46,093 INFO L495 AbstractCegarLoop]: Abstraction has 615 states and 895 transitions. [2022-07-12 19:25:46,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:46,094 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 895 transitions. [2022-07-12 19:25:46,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 19:25:46,094 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:46,094 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] [2022-07-12 19:25:46,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 19:25:46,095 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:46,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:46,095 INFO L85 PathProgramCache]: Analyzing trace with hash -70447564, now seen corresponding path program 1 times [2022-07-12 19:25:46,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:46,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559999453] [2022-07-12 19:25:46,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:46,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:46,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:46,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559999453] [2022-07-12 19:25:46,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559999453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:46,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:46,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:25:46,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393466051] [2022-07-12 19:25:46,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:46,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:25:46,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:46,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:25:46,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:25:46,160 INFO L87 Difference]: Start difference. First operand 615 states and 895 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:46,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:46,228 INFO L93 Difference]: Finished difference Result 632 states and 912 transitions. [2022-07-12 19:25:46,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:25:46,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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 36 [2022-07-12 19:25:46,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:46,230 INFO L225 Difference]: With dead ends: 632 [2022-07-12 19:25:46,231 INFO L226 Difference]: Without dead ends: 614 [2022-07-12 19:25:46,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:25:46,231 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 43 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:46,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1597 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:25:46,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-07-12 19:25:46,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2022-07-12 19:25:46,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 494 states have (on average 1.3481781376518218) internal successors, (666), 503 states have internal predecessors, (666), 85 states have call successors, (85), 32 states have call predecessors, (85), 34 states have return successors, (142), 80 states have call predecessors, (142), 77 states have call successors, (142) [2022-07-12 19:25:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 893 transitions. [2022-07-12 19:25:46,242 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 893 transitions. Word has length 36 [2022-07-12 19:25:46,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:46,243 INFO L495 AbstractCegarLoop]: Abstraction has 614 states and 893 transitions. [2022-07-12 19:25:46,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 893 transitions. [2022-07-12 19:25:46,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 19:25:46,243 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:46,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:46,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 19:25:46,244 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:46,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:46,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1099539614, now seen corresponding path program 1 times [2022-07-12 19:25:46,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:46,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871507192] [2022-07-12 19:25:46,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:46,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:46,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 19:25:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:46,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:46,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871507192] [2022-07-12 19:25:46,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871507192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:46,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:46,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:25:46,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484956003] [2022-07-12 19:25:46,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:46,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:25:46,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:46,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:25:46,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:25:46,272 INFO L87 Difference]: Start difference. First operand 614 states and 893 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:46,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:46,415 INFO L93 Difference]: Finished difference Result 653 states and 948 transitions. [2022-07-12 19:25:46,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:25:46,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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 38 [2022-07-12 19:25:46,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:46,417 INFO L225 Difference]: With dead ends: 653 [2022-07-12 19:25:46,417 INFO L226 Difference]: Without dead ends: 626 [2022-07-12 19:25:46,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:25:46,419 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 98 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:46,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1128 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:25:46,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2022-07-12 19:25:46,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 599. [2022-07-12 19:25:46,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 481 states have (on average 1.3534303534303533) internal successors, (651), 490 states have internal predecessors, (651), 84 states have call successors, (84), 31 states have call predecessors, (84), 33 states have return successors, (141), 79 states have call predecessors, (141), 76 states have call successors, (141) [2022-07-12 19:25:46,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 876 transitions. [2022-07-12 19:25:46,433 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 876 transitions. Word has length 38 [2022-07-12 19:25:46,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:46,434 INFO L495 AbstractCegarLoop]: Abstraction has 599 states and 876 transitions. [2022-07-12 19:25:46,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:46,434 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 876 transitions. [2022-07-12 19:25:46,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:25:46,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:46,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:46,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 19:25:46,435 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:46,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:46,436 INFO L85 PathProgramCache]: Analyzing trace with hash 233678839, now seen corresponding path program 1 times [2022-07-12 19:25:46,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:46,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162780520] [2022-07-12 19:25:46,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:46,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:46,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:46,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:46,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162780520] [2022-07-12 19:25:46,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162780520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:46,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:46,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:25:46,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973155591] [2022-07-12 19:25:46,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:46,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:25:46,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:46,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:25:46,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:25:46,479 INFO L87 Difference]: Start difference. First operand 599 states and 876 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:46,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:46,537 INFO L93 Difference]: Finished difference Result 611 states and 889 transitions. [2022-07-12 19:25:46,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:25:46,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-12 19:25:46,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:46,539 INFO L225 Difference]: With dead ends: 611 [2022-07-12 19:25:46,539 INFO L226 Difference]: Without dead ends: 610 [2022-07-12 19:25:46,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:25:46,540 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 46 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:46,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1234 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:25:46,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-07-12 19:25:46,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 606. [2022-07-12 19:25:46,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 488 states have (on average 1.3504098360655739) internal successors, (659), 497 states have internal predecessors, (659), 84 states have call successors, (84), 31 states have call predecessors, (84), 33 states have return successors, (141), 79 states have call predecessors, (141), 76 states have call successors, (141) [2022-07-12 19:25:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 884 transitions. [2022-07-12 19:25:46,550 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 884 transitions. Word has length 37 [2022-07-12 19:25:46,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:46,551 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 884 transitions. [2022-07-12 19:25:46,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:46,551 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 884 transitions. [2022-07-12 19:25:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:25:46,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:46,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:46,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 19:25:46,552 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:46,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:46,552 INFO L85 PathProgramCache]: Analyzing trace with hash 233402009, now seen corresponding path program 1 times [2022-07-12 19:25:46,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:46,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817580609] [2022-07-12 19:25:46,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:46,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:46,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:46,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:46,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817580609] [2022-07-12 19:25:46,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817580609] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:46,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:46,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:25:46,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205020352] [2022-07-12 19:25:46,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:46,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:25:46,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:46,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:25:46,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:25:46,582 INFO L87 Difference]: Start difference. First operand 606 states and 884 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:46,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:46,744 INFO L93 Difference]: Finished difference Result 852 states and 1305 transitions. [2022-07-12 19:25:46,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:25:46,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-12 19:25:46,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:46,748 INFO L225 Difference]: With dead ends: 852 [2022-07-12 19:25:46,748 INFO L226 Difference]: Without dead ends: 827 [2022-07-12 19:25:46,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:25:46,748 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 392 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:46,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 578 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:25:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2022-07-12 19:25:46,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 583. [2022-07-12 19:25:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 465 states have (on average 1.3591397849462366) internal successors, (632), 474 states have internal predecessors, (632), 84 states have call successors, (84), 31 states have call predecessors, (84), 33 states have return successors, (141), 79 states have call predecessors, (141), 76 states have call successors, (141) [2022-07-12 19:25:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 857 transitions. [2022-07-12 19:25:46,761 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 857 transitions. Word has length 37 [2022-07-12 19:25:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:46,762 INFO L495 AbstractCegarLoop]: Abstraction has 583 states and 857 transitions. [2022-07-12 19:25:46,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:25:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 857 transitions. [2022-07-12 19:25:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 19:25:46,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:46,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:46,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 19:25:46,763 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:46,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:46,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1478054632, now seen corresponding path program 1 times [2022-07-12 19:25:46,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:46,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81540491] [2022-07-12 19:25:46,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:46,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:46,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 19:25:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:46,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 19:25:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:46,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:46,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81540491] [2022-07-12 19:25:46,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81540491] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:46,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:46,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:25:46,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328417921] [2022-07-12 19:25:46,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:46,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:25:46,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:46,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:25:46,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:25:46,796 INFO L87 Difference]: Start difference. First operand 583 states and 857 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:46,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:46,970 INFO L93 Difference]: Finished difference Result 726 states and 1109 transitions. [2022-07-12 19:25:46,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:25:46,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-07-12 19:25:46,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:46,973 INFO L225 Difference]: With dead ends: 726 [2022-07-12 19:25:46,974 INFO L226 Difference]: Without dead ends: 726 [2022-07-12 19:25:46,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:25:46,974 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 173 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:46,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 739 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:25:46,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2022-07-12 19:25:46,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 645. [2022-07-12 19:25:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 523 states have (on average 1.3652007648183557) internal successors, (714), 533 states have internal predecessors, (714), 86 states have call successors, (86), 31 states have call predecessors, (86), 35 states have return successors, (159), 80 states have call predecessors, (159), 78 states have call successors, (159) [2022-07-12 19:25:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 959 transitions. [2022-07-12 19:25:46,988 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 959 transitions. Word has length 43 [2022-07-12 19:25:46,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:46,988 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 959 transitions. [2022-07-12 19:25:46,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 959 transitions. [2022-07-12 19:25:46,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 19:25:46,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:46,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:46,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 19:25:46,990 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:46,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:46,990 INFO L85 PathProgramCache]: Analyzing trace with hash -268012581, now seen corresponding path program 1 times [2022-07-12 19:25:46,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:46,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423422348] [2022-07-12 19:25:46,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:46,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:47,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 19:25:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:47,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:47,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:47,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423422348] [2022-07-12 19:25:47,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423422348] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:47,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:47,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 19:25:47,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364455803] [2022-07-12 19:25:47,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:47,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:25:47,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:47,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:25:47,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:25:47,091 INFO L87 Difference]: Start difference. First operand 645 states and 959 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:47,407 INFO L93 Difference]: Finished difference Result 749 states and 1158 transitions. [2022-07-12 19:25:47,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:25:47,407 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-07-12 19:25:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:47,410 INFO L225 Difference]: With dead ends: 749 [2022-07-12 19:25:47,410 INFO L226 Difference]: Without dead ends: 729 [2022-07-12 19:25:47,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:25:47,411 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 102 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:47,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1385 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:25:47,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2022-07-12 19:25:47,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 644. [2022-07-12 19:25:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 522 states have (on average 1.3639846743295019) internal successors, (712), 532 states have internal predecessors, (712), 86 states have call successors, (86), 31 states have call predecessors, (86), 35 states have return successors, (159), 80 states have call predecessors, (159), 78 states have call successors, (159) [2022-07-12 19:25:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 957 transitions. [2022-07-12 19:25:47,423 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 957 transitions. Word has length 43 [2022-07-12 19:25:47,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:47,423 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 957 transitions. [2022-07-12 19:25:47,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:47,424 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 957 transitions. [2022-07-12 19:25:47,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 19:25:47,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:47,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:47,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 19:25:47,425 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:47,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:47,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1845246895, now seen corresponding path program 1 times [2022-07-12 19:25:47,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:47,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433026503] [2022-07-12 19:25:47,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:47,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:47,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 19:25:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:47,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:47,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:47,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433026503] [2022-07-12 19:25:47,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433026503] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:47,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:47,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:25:47,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164978073] [2022-07-12 19:25:47,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:47,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:25:47,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:47,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:25:47,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:25:47,473 INFO L87 Difference]: Start difference. First operand 644 states and 957 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:47,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:47,780 INFO L93 Difference]: Finished difference Result 815 states and 1297 transitions. [2022-07-12 19:25:47,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:25:47,781 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-07-12 19:25:47,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:47,785 INFO L225 Difference]: With dead ends: 815 [2022-07-12 19:25:47,785 INFO L226 Difference]: Without dead ends: 815 [2022-07-12 19:25:47,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:25:47,785 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 129 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:47,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1316 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:25:47,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2022-07-12 19:25:47,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 668. [2022-07-12 19:25:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 542 states have (on average 1.3542435424354244) internal successors, (734), 552 states have internal predecessors, (734), 86 states have call successors, (86), 31 states have call predecessors, (86), 39 states have return successors, (211), 84 states have call predecessors, (211), 78 states have call successors, (211) [2022-07-12 19:25:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1031 transitions. [2022-07-12 19:25:47,806 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 1031 transitions. Word has length 48 [2022-07-12 19:25:47,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:47,807 INFO L495 AbstractCegarLoop]: Abstraction has 668 states and 1031 transitions. [2022-07-12 19:25:47,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:47,807 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1031 transitions. [2022-07-12 19:25:47,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:25:47,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:47,807 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:47,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 19:25:47,808 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:47,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:47,808 INFO L85 PathProgramCache]: Analyzing trace with hash -615366385, now seen corresponding path program 1 times [2022-07-12 19:25:47,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:47,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429847286] [2022-07-12 19:25:47,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:47,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:47,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 19:25:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:47,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:47,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:47,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429847286] [2022-07-12 19:25:47,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429847286] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:47,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:47,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:25:47,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015092090] [2022-07-12 19:25:47,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:47,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:25:47,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:47,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:25:47,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:25:47,885 INFO L87 Difference]: Start difference. First operand 668 states and 1031 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:48,217 INFO L93 Difference]: Finished difference Result 726 states and 1118 transitions. [2022-07-12 19:25:48,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:25:48,218 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 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 44 [2022-07-12 19:25:48,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:48,220 INFO L225 Difference]: With dead ends: 726 [2022-07-12 19:25:48,220 INFO L226 Difference]: Without dead ends: 696 [2022-07-12 19:25:48,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:25:48,221 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 91 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:48,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1364 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:25:48,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-07-12 19:25:48,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 637. [2022-07-12 19:25:48,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 514 states have (on average 1.367704280155642) internal successors, (703), 523 states have internal predecessors, (703), 84 states have call successors, (84), 30 states have call predecessors, (84), 38 states have return successors, (210), 83 states have call predecessors, (210), 77 states have call successors, (210) [2022-07-12 19:25:48,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 997 transitions. [2022-07-12 19:25:48,233 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 997 transitions. Word has length 44 [2022-07-12 19:25:48,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:48,233 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 997 transitions. [2022-07-12 19:25:48,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:48,234 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 997 transitions. [2022-07-12 19:25:48,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 19:25:48,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:48,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:48,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 19:25:48,237 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:48,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:48,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1448694147, now seen corresponding path program 1 times [2022-07-12 19:25:48,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:48,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072020102] [2022-07-12 19:25:48,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:48,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:48,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 19:25:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:48,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:48,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:48,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:48,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072020102] [2022-07-12 19:25:48,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072020102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:48,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:48,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:25:48,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269631247] [2022-07-12 19:25:48,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:48,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:25:48,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:48,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:25:48,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:25:48,278 INFO L87 Difference]: Start difference. First operand 637 states and 997 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:48,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:48,512 INFO L93 Difference]: Finished difference Result 1213 states and 2011 transitions. [2022-07-12 19:25:48,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:25:48,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-07-12 19:25:48,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:48,531 INFO L225 Difference]: With dead ends: 1213 [2022-07-12 19:25:48,531 INFO L226 Difference]: Without dead ends: 1213 [2022-07-12 19:25:48,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:25:48,532 INFO L413 NwaCegarLoop]: 393 mSDtfsCounter, 296 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:48,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 803 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:48,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2022-07-12 19:25:48,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 645. [2022-07-12 19:25:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 522 states have (on average 1.3697318007662835) internal successors, (715), 531 states have internal predecessors, (715), 84 states have call successors, (84), 30 states have call predecessors, (84), 38 states have return successors, (210), 83 states have call predecessors, (210), 77 states have call successors, (210) [2022-07-12 19:25:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1009 transitions. [2022-07-12 19:25:48,551 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1009 transitions. Word has length 48 [2022-07-12 19:25:48,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:48,551 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 1009 transitions. [2022-07-12 19:25:48,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1009 transitions. [2022-07-12 19:25:48,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 19:25:48,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:48,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:48,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-12 19:25:48,554 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:48,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:48,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1116153965, now seen corresponding path program 1 times [2022-07-12 19:25:48,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:48,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681943101] [2022-07-12 19:25:48,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:48,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:48,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 19:25:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:48,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:48,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:48,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:48,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681943101] [2022-07-12 19:25:48,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681943101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:48,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:48,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:25:48,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881532576] [2022-07-12 19:25:48,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:48,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:25:48,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:48,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:25:48,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:25:48,607 INFO L87 Difference]: Start difference. First operand 645 states and 1009 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:48,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:48,906 INFO L93 Difference]: Finished difference Result 1361 states and 2165 transitions. [2022-07-12 19:25:48,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:25:48,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-07-12 19:25:48,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:48,911 INFO L225 Difference]: With dead ends: 1361 [2022-07-12 19:25:48,911 INFO L226 Difference]: Without dead ends: 1361 [2022-07-12 19:25:48,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:25:48,912 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 306 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:48,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 735 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:25:48,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2022-07-12 19:25:48,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1197. [2022-07-12 19:25:48,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 973 states have (on average 1.381294964028777) internal successors, (1344), 993 states have internal predecessors, (1344), 148 states have call successors, (148), 56 states have call predecessors, (148), 75 states have return successors, (416), 147 states have call predecessors, (416), 141 states have call successors, (416) [2022-07-12 19:25:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1908 transitions. [2022-07-12 19:25:48,942 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1908 transitions. Word has length 50 [2022-07-12 19:25:48,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:48,943 INFO L495 AbstractCegarLoop]: Abstraction has 1197 states and 1908 transitions. [2022-07-12 19:25:48,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1908 transitions. [2022-07-12 19:25:48,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 19:25:48,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:48,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:48,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-12 19:25:48,944 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:48,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:48,945 INFO L85 PathProgramCache]: Analyzing trace with hash 33672435, now seen corresponding path program 1 times [2022-07-12 19:25:48,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:48,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108433900] [2022-07-12 19:25:48,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:48,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:48,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:25:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:49,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:25:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:49,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:49,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:49,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:49,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108433900] [2022-07-12 19:25:49,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108433900] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:49,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:49,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:25:49,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228903679] [2022-07-12 19:25:49,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:49,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:25:49,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:49,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:25:49,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:25:49,094 INFO L87 Difference]: Start difference. First operand 1197 states and 1908 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:25:49,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:49,446 INFO L93 Difference]: Finished difference Result 1236 states and 1967 transitions. [2022-07-12 19:25:49,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:25:49,447 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-07-12 19:25:49,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:49,450 INFO L225 Difference]: With dead ends: 1236 [2022-07-12 19:25:49,450 INFO L226 Difference]: Without dead ends: 1236 [2022-07-12 19:25:49,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:25:49,451 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 188 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:49,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1119 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:25:49,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2022-07-12 19:25:49,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1145. [2022-07-12 19:25:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 921 states have (on average 1.3659066232356134) internal successors, (1258), 941 states have internal predecessors, (1258), 148 states have call successors, (148), 56 states have call predecessors, (148), 75 states have return successors, (416), 147 states have call predecessors, (416), 141 states have call successors, (416) [2022-07-12 19:25:49,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1822 transitions. [2022-07-12 19:25:49,473 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1822 transitions. Word has length 50 [2022-07-12 19:25:49,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:49,474 INFO L495 AbstractCegarLoop]: Abstraction has 1145 states and 1822 transitions. [2022-07-12 19:25:49,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:25:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1822 transitions. [2022-07-12 19:25:49,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 19:25:49,475 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:49,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:49,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-12 19:25:49,475 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:49,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:49,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1244659166, now seen corresponding path program 1 times [2022-07-12 19:25:49,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:49,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498033385] [2022-07-12 19:25:49,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:49,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:49,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 19:25:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:49,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:49,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:49,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498033385] [2022-07-12 19:25:49,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498033385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:49,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:49,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:25:49,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552962205] [2022-07-12 19:25:49,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:49,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:25:49,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:49,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:25:49,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:25:49,524 INFO L87 Difference]: Start difference. First operand 1145 states and 1822 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:49,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:49,646 INFO L93 Difference]: Finished difference Result 332 states and 475 transitions. [2022-07-12 19:25:49,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:25:49,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2022-07-12 19:25:49,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:49,648 INFO L225 Difference]: With dead ends: 332 [2022-07-12 19:25:49,648 INFO L226 Difference]: Without dead ends: 332 [2022-07-12 19:25:49,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:25:49,649 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 246 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:49,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 405 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:25:49,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-07-12 19:25:49,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2022-07-12 19:25:49,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 260 states have (on average 1.273076923076923) internal successors, (331), 264 states have internal predecessors, (331), 50 states have call successors, (50), 17 states have call predecessors, (50), 21 states have return successors, (94), 50 states have call predecessors, (94), 47 states have call successors, (94) [2022-07-12 19:25:49,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 475 transitions. [2022-07-12 19:25:49,654 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 475 transitions. Word has length 49 [2022-07-12 19:25:49,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:49,654 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 475 transitions. [2022-07-12 19:25:49,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:49,655 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 475 transitions. [2022-07-12 19:25:49,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-12 19:25:49,655 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:49,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:49,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-12 19:25:49,656 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:49,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:49,656 INFO L85 PathProgramCache]: Analyzing trace with hash 929022604, now seen corresponding path program 1 times [2022-07-12 19:25:49,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:49,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756351441] [2022-07-12 19:25:49,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:49,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:49,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:25:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:49,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:25:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:49,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:49,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:49,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:49,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756351441] [2022-07-12 19:25:49,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756351441] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:49,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:49,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 19:25:49,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718818752] [2022-07-12 19:25:49,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:49,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:25:49,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:49,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:25:49,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:25:49,740 INFO L87 Difference]: Start difference. First operand 332 states and 475 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:25:49,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:49,955 INFO L93 Difference]: Finished difference Result 327 states and 462 transitions. [2022-07-12 19:25:49,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:25:49,956 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2022-07-12 19:25:49,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:49,957 INFO L225 Difference]: With dead ends: 327 [2022-07-12 19:25:49,957 INFO L226 Difference]: Without dead ends: 327 [2022-07-12 19:25:49,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:25:49,957 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 233 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:49,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 624 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-07-12 19:25:49,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2022-07-12 19:25:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 256 states have (on average 1.26171875) internal successors, (323), 260 states have internal predecessors, (323), 50 states have call successors, (50), 17 states have call predecessors, (50), 20 states have return successors, (89), 49 states have call predecessors, (89), 47 states have call successors, (89) [2022-07-12 19:25:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 462 transitions. [2022-07-12 19:25:49,963 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 462 transitions. Word has length 54 [2022-07-12 19:25:49,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:49,963 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 462 transitions. [2022-07-12 19:25:49,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:25:49,963 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 462 transitions. [2022-07-12 19:25:49,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 19:25:49,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:49,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-12 19:25:49,964 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:49,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:49,965 INFO L85 PathProgramCache]: Analyzing trace with hash 677437189, now seen corresponding path program 1 times [2022-07-12 19:25:49,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:49,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591543469] [2022-07-12 19:25:49,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:49,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:49,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:25:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:49,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:25:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:50,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:50,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591543469] [2022-07-12 19:25:50,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591543469] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:50,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:50,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:25:50,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855570031] [2022-07-12 19:25:50,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:50,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:25:50,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:50,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:25:50,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:25:50,033 INFO L87 Difference]: Start difference. First operand 327 states and 462 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 19:25:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:50,167 INFO L93 Difference]: Finished difference Result 339 states and 485 transitions. [2022-07-12 19:25:50,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:25:50,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2022-07-12 19:25:50,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:50,168 INFO L225 Difference]: With dead ends: 339 [2022-07-12 19:25:50,168 INFO L226 Difference]: Without dead ends: 339 [2022-07-12 19:25:50,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:25:50,169 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 64 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:50,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 700 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:25:50,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-07-12 19:25:50,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 330. [2022-07-12 19:25:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 259 states have (on average 1.2586872586872586) internal successors, (326), 263 states have internal predecessors, (326), 50 states have call successors, (50), 17 states have call predecessors, (50), 20 states have return successors, (89), 49 states have call predecessors, (89), 47 states have call successors, (89) [2022-07-12 19:25:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 465 transitions. [2022-07-12 19:25:50,175 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 465 transitions. Word has length 57 [2022-07-12 19:25:50,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:50,175 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 465 transitions. [2022-07-12 19:25:50,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 19:25:50,176 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 465 transitions. [2022-07-12 19:25:50,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 19:25:50,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:50,176 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:50,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-12 19:25:50,176 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:50,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:50,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1289316037, now seen corresponding path program 1 times [2022-07-12 19:25:50,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:50,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100982349] [2022-07-12 19:25:50,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:50,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:25:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:25:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:50,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:50,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100982349] [2022-07-12 19:25:50,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100982349] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:50,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:50,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 19:25:50,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748067516] [2022-07-12 19:25:50,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:50,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:25:50,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:50,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:25:50,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:25:50,263 INFO L87 Difference]: Start difference. First operand 330 states and 465 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 19:25:50,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:50,484 INFO L93 Difference]: Finished difference Result 333 states and 466 transitions. [2022-07-12 19:25:50,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:25:50,484 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2022-07-12 19:25:50,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:50,485 INFO L225 Difference]: With dead ends: 333 [2022-07-12 19:25:50,486 INFO L226 Difference]: Without dead ends: 333 [2022-07-12 19:25:50,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:25:50,486 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 66 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:50,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1190 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-07-12 19:25:50,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2022-07-12 19:25:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 259 states have (on average 1.247104247104247) internal successors, (323), 263 states have internal predecessors, (323), 50 states have call successors, (50), 17 states have call predecessors, (50), 20 states have return successors, (89), 49 states have call predecessors, (89), 47 states have call successors, (89) [2022-07-12 19:25:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 462 transitions. [2022-07-12 19:25:50,492 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 462 transitions. Word has length 57 [2022-07-12 19:25:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:50,492 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 462 transitions. [2022-07-12 19:25:50,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 19:25:50,492 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 462 transitions. [2022-07-12 19:25:50,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-12 19:25:50,493 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:50,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:50,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-12 19:25:50,494 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:50,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:50,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1579853377, now seen corresponding path program 1 times [2022-07-12 19:25:50,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:50,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856241892] [2022-07-12 19:25:50,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:50,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:25:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:25:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 19:25:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:50,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:50,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856241892] [2022-07-12 19:25:50,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856241892] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:50,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:50,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:25:50,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258821568] [2022-07-12 19:25:50,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:50,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:25:50,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:50,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:25:50,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:25:50,574 INFO L87 Difference]: Start difference. First operand 330 states and 462 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 19:25:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:50,823 INFO L93 Difference]: Finished difference Result 308 states and 421 transitions. [2022-07-12 19:25:50,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:25:50,823 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-07-12 19:25:50,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:50,824 INFO L225 Difference]: With dead ends: 308 [2022-07-12 19:25:50,824 INFO L226 Difference]: Without dead ends: 308 [2022-07-12 19:25:50,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-07-12 19:25:50,825 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 197 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:50,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 925 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:50,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-12 19:25:50,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 300. [2022-07-12 19:25:50,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 235 states have (on average 1.251063829787234) internal successors, (294), 241 states have internal predecessors, (294), 47 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (68), 41 states have call predecessors, (68), 44 states have call successors, (68) [2022-07-12 19:25:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 409 transitions. [2022-07-12 19:25:50,830 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 409 transitions. Word has length 68 [2022-07-12 19:25:50,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:50,830 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 409 transitions. [2022-07-12 19:25:50,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 19:25:50,830 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 409 transitions. [2022-07-12 19:25:50,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-12 19:25:50,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:50,831 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:50,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-12 19:25:50,831 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:50,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:50,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2132296105, now seen corresponding path program 1 times [2022-07-12 19:25:50,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:50,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531348504] [2022-07-12 19:25:50,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:50,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:25:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:25:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 19:25:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:50,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:50,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531348504] [2022-07-12 19:25:50,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531348504] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:50,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:50,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-12 19:25:50,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991984467] [2022-07-12 19:25:50,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:50,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 19:25:50,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:50,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 19:25:50,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:25:50,962 INFO L87 Difference]: Start difference. First operand 300 states and 409 transitions. Second operand has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 19:25:51,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:51,371 INFO L93 Difference]: Finished difference Result 333 states and 455 transitions. [2022-07-12 19:25:51,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 19:25:51,372 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 73 [2022-07-12 19:25:51,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:51,373 INFO L225 Difference]: With dead ends: 333 [2022-07-12 19:25:51,373 INFO L226 Difference]: Without dead ends: 315 [2022-07-12 19:25:51,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-07-12 19:25:51,374 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 125 mSDsluCounter, 2007 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 2203 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:51,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 2203 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:25:51,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-07-12 19:25:51,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 303. [2022-07-12 19:25:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 237 states have (on average 1.248945147679325) internal successors, (296), 244 states have internal predecessors, (296), 47 states have call successors, (47), 17 states have call predecessors, (47), 18 states have return successors, (69), 41 states have call predecessors, (69), 44 states have call successors, (69) [2022-07-12 19:25:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 412 transitions. [2022-07-12 19:25:51,379 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 412 transitions. Word has length 73 [2022-07-12 19:25:51,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:51,379 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 412 transitions. [2022-07-12 19:25:51,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 19:25:51,380 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 412 transitions. [2022-07-12 19:25:51,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-12 19:25:51,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:51,381 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:51,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-12 19:25:51,381 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:51,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:51,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2002463371, now seen corresponding path program 1 times [2022-07-12 19:25:51,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:51,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859685811] [2022-07-12 19:25:51,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:51,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:51,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:25:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:51,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:25:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:51,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:51,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:51,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 19:25:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:51,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:51,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:51,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859685811] [2022-07-12 19:25:51,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859685811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:51,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:51,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-12 19:25:51,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406634869] [2022-07-12 19:25:51,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:51,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 19:25:51,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:51,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 19:25:51,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:25:51,515 INFO L87 Difference]: Start difference. First operand 303 states and 412 transitions. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 19:25:51,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:51,944 INFO L93 Difference]: Finished difference Result 337 states and 459 transitions. [2022-07-12 19:25:51,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 19:25:51,945 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2022-07-12 19:25:51,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:51,946 INFO L225 Difference]: With dead ends: 337 [2022-07-12 19:25:51,946 INFO L226 Difference]: Without dead ends: 319 [2022-07-12 19:25:51,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-07-12 19:25:51,946 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 126 mSDsluCounter, 2170 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 2379 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:51,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 2379 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:25:51,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-12 19:25:51,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 303. [2022-07-12 19:25:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 237 states have (on average 1.248945147679325) internal successors, (296), 244 states have internal predecessors, (296), 47 states have call successors, (47), 17 states have call predecessors, (47), 18 states have return successors, (69), 41 states have call predecessors, (69), 44 states have call successors, (69) [2022-07-12 19:25:51,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 412 transitions. [2022-07-12 19:25:51,951 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 412 transitions. Word has length 74 [2022-07-12 19:25:51,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:51,951 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 412 transitions. [2022-07-12 19:25:51,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 19:25:51,951 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 412 transitions. [2022-07-12 19:25:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 19:25:51,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:51,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:51,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-12 19:25:51,952 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:51,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:51,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1293155315, now seen corresponding path program 1 times [2022-07-12 19:25:51,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:51,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371937384] [2022-07-12 19:25:51,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:51,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:52,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 19:25:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:52,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:25:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:52,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:52,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:52,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 19:25:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:52,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 19:25:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:52,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-12 19:25:52,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:52,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371937384] [2022-07-12 19:25:52,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371937384] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:52,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:52,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-12 19:25:52,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125512880] [2022-07-12 19:25:52,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:52,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 19:25:52,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:52,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 19:25:52,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-07-12 19:25:52,098 INFO L87 Difference]: Start difference. First operand 303 states and 412 transitions. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 19:25:52,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:52,843 INFO L93 Difference]: Finished difference Result 443 states and 663 transitions. [2022-07-12 19:25:52,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 19:25:52,843 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 82 [2022-07-12 19:25:52,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:52,845 INFO L225 Difference]: With dead ends: 443 [2022-07-12 19:25:52,845 INFO L226 Difference]: Without dead ends: 415 [2022-07-12 19:25:52,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2022-07-12 19:25:52,845 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 194 mSDsluCounter, 2411 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 2652 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:52,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 2652 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 19:25:52,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-07-12 19:25:52,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 399. [2022-07-12 19:25:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 305 states have (on average 1.259016393442623) internal successors, (384), 316 states have internal predecessors, (384), 74 states have call successors, (74), 17 states have call predecessors, (74), 19 states have return successors, (108), 65 states have call predecessors, (108), 70 states have call successors, (108) [2022-07-12 19:25:52,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 566 transitions. [2022-07-12 19:25:52,852 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 566 transitions. Word has length 82 [2022-07-12 19:25:52,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:52,852 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 566 transitions. [2022-07-12 19:25:52,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 19:25:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 566 transitions. [2022-07-12 19:25:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-12 19:25:52,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:52,853 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:52,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-12 19:25:52,853 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:52,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:52,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1315841768, now seen corresponding path program 1 times [2022-07-12 19:25:52,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:52,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701931650] [2022-07-12 19:25:52,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:52,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:52,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:25:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:52,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:25:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:52,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:52,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:52,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 19:25:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:52,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 19:25:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:52,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:52,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:52,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701931650] [2022-07-12 19:25:52,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701931650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:52,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:52,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 19:25:52,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913961242] [2022-07-12 19:25:52,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:52,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:25:52,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:52,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:25:52,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:25:52,984 INFO L87 Difference]: Start difference. First operand 399 states and 566 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:25:53,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:53,383 INFO L93 Difference]: Finished difference Result 520 states and 710 transitions. [2022-07-12 19:25:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 19:25:53,383 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 84 [2022-07-12 19:25:53,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:53,385 INFO L225 Difference]: With dead ends: 520 [2022-07-12 19:25:53,385 INFO L226 Difference]: Without dead ends: 520 [2022-07-12 19:25:53,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2022-07-12 19:25:53,385 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 311 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:53,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1279 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:25:53,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-07-12 19:25:53,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 478. [2022-07-12 19:25:53,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 373 states have (on average 1.2520107238605898) internal successors, (467), 383 states have internal predecessors, (467), 77 states have call successors, (77), 23 states have call predecessors, (77), 27 states have return successors, (112), 71 states have call predecessors, (112), 73 states have call successors, (112) [2022-07-12 19:25:53,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 656 transitions. [2022-07-12 19:25:53,392 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 656 transitions. Word has length 84 [2022-07-12 19:25:53,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:53,392 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 656 transitions. [2022-07-12 19:25:53,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:25:53,392 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 656 transitions. [2022-07-12 19:25:53,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-12 19:25:53,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:53,393 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:53,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-12 19:25:53,393 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:53,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:53,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1543379991, now seen corresponding path program 1 times [2022-07-12 19:25:53,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:53,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361630358] [2022-07-12 19:25:53,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:53,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:53,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:25:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:53,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:25:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:53,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:53,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:53,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 19:25:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:53,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 19:25:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:53,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:53,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:53,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361630358] [2022-07-12 19:25:53,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361630358] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:53,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:53,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 19:25:53,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631301181] [2022-07-12 19:25:53,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:53,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:25:53,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:53,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:25:53,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:25:53,485 INFO L87 Difference]: Start difference. First operand 478 states and 656 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:25:53,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:53,925 INFO L93 Difference]: Finished difference Result 478 states and 646 transitions. [2022-07-12 19:25:53,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 19:25:53,925 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 84 [2022-07-12 19:25:53,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:53,927 INFO L225 Difference]: With dead ends: 478 [2022-07-12 19:25:53,927 INFO L226 Difference]: Without dead ends: 478 [2022-07-12 19:25:53,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-07-12 19:25:53,927 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 453 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:53,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 812 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:25:53,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-07-12 19:25:53,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2022-07-12 19:25:53,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 373 states have (on average 1.2466487935656836) internal successors, (465), 383 states have internal predecessors, (465), 77 states have call successors, (77), 23 states have call predecessors, (77), 27 states have return successors, (104), 71 states have call predecessors, (104), 73 states have call successors, (104) [2022-07-12 19:25:53,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 646 transitions. [2022-07-12 19:25:53,934 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 646 transitions. Word has length 84 [2022-07-12 19:25:53,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:53,934 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 646 transitions. [2022-07-12 19:25:53,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:25:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 646 transitions. [2022-07-12 19:25:53,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-12 19:25:53,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:53,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:53,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-12 19:25:53,935 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:53,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:53,936 INFO L85 PathProgramCache]: Analyzing trace with hash -654013751, now seen corresponding path program 1 times [2022-07-12 19:25:53,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:53,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91653562] [2022-07-12 19:25:53,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:53,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:54,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 19:25:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:54,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:25:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:54,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:54,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:54,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 19:25:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:54,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 19:25:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:54,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:54,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:54,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91653562] [2022-07-12 19:25:54,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91653562] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:54,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:54,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-12 19:25:54,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646662787] [2022-07-12 19:25:54,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:54,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 19:25:54,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:54,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 19:25:54,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-07-12 19:25:54,118 INFO L87 Difference]: Start difference. First operand 478 states and 646 transitions. Second operand has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 11 states have internal predecessors, (70), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 19:25:54,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:54,865 INFO L93 Difference]: Finished difference Result 628 states and 917 transitions. [2022-07-12 19:25:54,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 19:25:54,866 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 11 states have internal predecessors, (70), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 83 [2022-07-12 19:25:54,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:54,868 INFO L225 Difference]: With dead ends: 628 [2022-07-12 19:25:54,868 INFO L226 Difference]: Without dead ends: 592 [2022-07-12 19:25:54,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2022-07-12 19:25:54,871 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 222 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 2187 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:54,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 2187 Invalid, 1698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 19:25:54,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-07-12 19:25:54,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 475. [2022-07-12 19:25:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 371 states have (on average 1.247978436657682) internal successors, (463), 380 states have internal predecessors, (463), 77 states have call successors, (77), 23 states have call predecessors, (77), 26 states have return successors, (103), 71 states have call predecessors, (103), 73 states have call successors, (103) [2022-07-12 19:25:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 643 transitions. [2022-07-12 19:25:54,881 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 643 transitions. Word has length 83 [2022-07-12 19:25:54,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:54,881 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 643 transitions. [2022-07-12 19:25:54,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 11 states have internal predecessors, (70), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 19:25:54,881 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 643 transitions. [2022-07-12 19:25:54,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-12 19:25:54,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:54,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:54,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-12 19:25:54,882 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:54,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:54,883 INFO L85 PathProgramCache]: Analyzing trace with hash -177974759, now seen corresponding path program 1 times [2022-07-12 19:25:54,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:54,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205259525] [2022-07-12 19:25:54,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:54,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:54,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:25:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:54,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:25:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:54,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:54,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 19:25:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 19:25:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:55,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:55,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205259525] [2022-07-12 19:25:55,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205259525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:55,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:55,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-12 19:25:55,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092505215] [2022-07-12 19:25:55,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:55,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 19:25:55,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:55,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 19:25:55,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:25:55,011 INFO L87 Difference]: Start difference. First operand 475 states and 643 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 19:25:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:55,627 INFO L93 Difference]: Finished difference Result 927 states and 1259 transitions. [2022-07-12 19:25:55,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 19:25:55,628 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 84 [2022-07-12 19:25:55,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:55,630 INFO L225 Difference]: With dead ends: 927 [2022-07-12 19:25:55,630 INFO L226 Difference]: Without dead ends: 906 [2022-07-12 19:25:55,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2022-07-12 19:25:55,634 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 348 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:55,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 2135 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 19:25:55,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2022-07-12 19:25:55,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 567. [2022-07-12 19:25:55,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 447 states have (on average 1.2170022371364653) internal successors, (544), 459 states have internal predecessors, (544), 83 states have call successors, (83), 29 states have call predecessors, (83), 36 states have return successors, (113), 78 states have call predecessors, (113), 79 states have call successors, (113) [2022-07-12 19:25:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 740 transitions. [2022-07-12 19:25:55,646 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 740 transitions. Word has length 84 [2022-07-12 19:25:55,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:55,647 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 740 transitions. [2022-07-12 19:25:55,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 19:25:55,647 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 740 transitions. [2022-07-12 19:25:55,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-12 19:25:55,648 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:55,648 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:55,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-12 19:25:55,649 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:55,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:55,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1320477225, now seen corresponding path program 1 times [2022-07-12 19:25:55,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:55,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873089027] [2022-07-12 19:25:55,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:55,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:25:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:25:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 19:25:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 19:25:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:55,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:55,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873089027] [2022-07-12 19:25:55,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873089027] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:55,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:55,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-12 19:25:55,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471094191] [2022-07-12 19:25:55,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:55,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 19:25:55,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:55,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 19:25:55,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:25:55,783 INFO L87 Difference]: Start difference. First operand 567 states and 740 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 19:25:56,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:56,371 INFO L93 Difference]: Finished difference Result 924 states and 1251 transitions. [2022-07-12 19:25:56,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 19:25:56,372 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 84 [2022-07-12 19:25:56,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:56,374 INFO L225 Difference]: With dead ends: 924 [2022-07-12 19:25:56,374 INFO L226 Difference]: Without dead ends: 899 [2022-07-12 19:25:56,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2022-07-12 19:25:56,374 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 320 mSDsluCounter, 2676 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 3023 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:56,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 3023 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:25:56,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2022-07-12 19:25:56,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 468. [2022-07-12 19:25:56,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 366 states have (on average 1.2486338797814207) internal successors, (457), 375 states have internal predecessors, (457), 75 states have call successors, (75), 23 states have call predecessors, (75), 26 states have return successors, (100), 69 states have call predecessors, (100), 71 states have call successors, (100) [2022-07-12 19:25:56,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 632 transitions. [2022-07-12 19:25:56,383 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 632 transitions. Word has length 84 [2022-07-12 19:25:56,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:56,383 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 632 transitions. [2022-07-12 19:25:56,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 19:25:56,384 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 632 transitions. [2022-07-12 19:25:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-12 19:25:56,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:56,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:56,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-12 19:25:56,385 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:56,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:56,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1169943443, now seen corresponding path program 1 times [2022-07-12 19:25:56,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:56,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070886104] [2022-07-12 19:25:56,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:56,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:56,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 19:25:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:56,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:25:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:56,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:56,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:56,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 19:25:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:56,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 19:25:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:56,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 19:25:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:56,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:56,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:56,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070886104] [2022-07-12 19:25:56,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070886104] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:56,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:56,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-12 19:25:56,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21458060] [2022-07-12 19:25:56,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:56,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 19:25:56,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:56,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 19:25:56,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:25:56,527 INFO L87 Difference]: Start difference. First operand 468 states and 632 transitions. Second operand has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-12 19:25:57,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:57,426 INFO L93 Difference]: Finished difference Result 929 states and 1255 transitions. [2022-07-12 19:25:57,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 19:25:57,426 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 93 [2022-07-12 19:25:57,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:57,428 INFO L225 Difference]: With dead ends: 929 [2022-07-12 19:25:57,428 INFO L226 Difference]: Without dead ends: 885 [2022-07-12 19:25:57,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 19:25:57,429 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 439 mSDsluCounter, 2000 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 2251 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:57,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 2251 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 19:25:57,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2022-07-12 19:25:57,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 858. [2022-07-12 19:25:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 666 states have (on average 1.2147147147147148) internal successors, (809), 684 states have internal predecessors, (809), 142 states have call successors, (142), 43 states have call predecessors, (142), 49 states have return successors, (185), 130 states have call predecessors, (185), 137 states have call successors, (185) [2022-07-12 19:25:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1136 transitions. [2022-07-12 19:25:57,441 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1136 transitions. Word has length 93 [2022-07-12 19:25:57,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:57,442 INFO L495 AbstractCegarLoop]: Abstraction has 858 states and 1136 transitions. [2022-07-12 19:25:57,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-12 19:25:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1136 transitions. [2022-07-12 19:25:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-12 19:25:57,443 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:57,443 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:57,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-12 19:25:57,444 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:57,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:57,444 INFO L85 PathProgramCache]: Analyzing trace with hash -274894159, now seen corresponding path program 1 times [2022-07-12 19:25:57,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:57,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918524689] [2022-07-12 19:25:57,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:57,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:57,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 19:25:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:57,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:25:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:57,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:57,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:57,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 19:25:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:57,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 19:25:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:57,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:57,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 19:25:57,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:57,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918524689] [2022-07-12 19:25:57,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918524689] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:57,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:57,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 19:25:57,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872202087] [2022-07-12 19:25:57,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:57,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:25:57,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:57,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:25:57,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:25:57,543 INFO L87 Difference]: Start difference. First operand 858 states and 1136 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 19:25:57,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:57,925 INFO L93 Difference]: Finished difference Result 1142 states and 1584 transitions. [2022-07-12 19:25:57,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:25:57,926 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 95 [2022-07-12 19:25:57,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:57,928 INFO L225 Difference]: With dead ends: 1142 [2022-07-12 19:25:57,928 INFO L226 Difference]: Without dead ends: 1142 [2022-07-12 19:25:57,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:25:57,929 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 158 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:57,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1346 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:25:57,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2022-07-12 19:25:57,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 834. [2022-07-12 19:25:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 650 states have (on average 1.1953846153846155) internal successors, (777), 664 states have internal predecessors, (777), 134 states have call successors, (134), 43 states have call predecessors, (134), 49 states have return successors, (173), 126 states have call predecessors, (173), 129 states have call successors, (173) [2022-07-12 19:25:57,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1084 transitions. [2022-07-12 19:25:57,941 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1084 transitions. Word has length 95 [2022-07-12 19:25:57,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:57,942 INFO L495 AbstractCegarLoop]: Abstraction has 834 states and 1084 transitions. [2022-07-12 19:25:57,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 19:25:57,942 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1084 transitions. [2022-07-12 19:25:57,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-12 19:25:57,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:57,943 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:57,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-07-12 19:25:57,943 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:57,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1940677009, now seen corresponding path program 1 times [2022-07-12 19:25:57,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:57,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030545592] [2022-07-12 19:25:57,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:57,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:58,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 19:25:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:58,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:25:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:58,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:58,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:58,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 19:25:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:58,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 19:25:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:58,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 19:25:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:58,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:58,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030545592] [2022-07-12 19:25:58,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030545592] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:58,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:58,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-12 19:25:58,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990256748] [2022-07-12 19:25:58,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:58,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 19:25:58,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:58,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 19:25:58,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:25:58,073 INFO L87 Difference]: Start difference. First operand 834 states and 1084 transitions. Second operand has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-12 19:25:59,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:59,140 INFO L93 Difference]: Finished difference Result 855 states and 1113 transitions. [2022-07-12 19:25:59,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 19:25:59,140 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 93 [2022-07-12 19:25:59,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:59,142 INFO L225 Difference]: With dead ends: 855 [2022-07-12 19:25:59,143 INFO L226 Difference]: Without dead ends: 809 [2022-07-12 19:25:59,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 19:25:59,143 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 342 mSDsluCounter, 2838 mSDsCounter, 0 mSdLazyCounter, 2220 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 3194 SdHoareTripleChecker+Invalid, 2313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:59,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 3194 Invalid, 2313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2220 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 19:25:59,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-12 19:25:59,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 306. [2022-07-12 19:25:59,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 242 states have (on average 1.1363636363636365) internal successors, (275), 247 states have internal predecessors, (275), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (48), 37 states have call predecessors, (48), 38 states have call successors, (48) [2022-07-12 19:25:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 364 transitions. [2022-07-12 19:25:59,166 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 364 transitions. Word has length 93 [2022-07-12 19:25:59,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:59,166 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 364 transitions. [2022-07-12 19:25:59,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-12 19:25:59,167 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 364 transitions. [2022-07-12 19:25:59,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-12 19:25:59,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:59,168 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:59,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-07-12 19:25:59,168 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:59,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:59,169 INFO L85 PathProgramCache]: Analyzing trace with hash -369931013, now seen corresponding path program 1 times [2022-07-12 19:25:59,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:59,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375565139] [2022-07-12 19:25:59,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:59,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 19:25:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:25:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 19:25:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 19:25:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 19:25:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 19:25:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-12 19:25:59,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:59,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375565139] [2022-07-12 19:25:59,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375565139] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:25:59,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023370898] [2022-07-12 19:25:59,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:59,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:25:59,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:25:59,269 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:25:59,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 19:25:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:25:59,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:25:59,547 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 19:25:59,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:25:59,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023370898] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:59,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:25:59,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-07-12 19:25:59,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125728673] [2022-07-12 19:25:59,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:59,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:25:59,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:59,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:25:59,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-07-12 19:25:59,550 INFO L87 Difference]: Start difference. First operand 306 states and 364 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 19:25:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:59,613 INFO L93 Difference]: Finished difference Result 328 states and 392 transitions. [2022-07-12 19:25:59,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:25:59,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 133 [2022-07-12 19:25:59,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:59,614 INFO L225 Difference]: With dead ends: 328 [2022-07-12 19:25:59,614 INFO L226 Difference]: Without dead ends: 327 [2022-07-12 19:25:59,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:25:59,615 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:59,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 715 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:25:59,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-07-12 19:25:59,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 322. [2022-07-12 19:25:59,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 256 states have (on average 1.12890625) internal successors, (289), 262 states have internal predecessors, (289), 41 states have call successors, (41), 21 states have call predecessors, (41), 24 states have return successors, (55), 38 states have call predecessors, (55), 38 states have call successors, (55) [2022-07-12 19:25:59,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 385 transitions. [2022-07-12 19:25:59,619 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 385 transitions. Word has length 133 [2022-07-12 19:25:59,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:59,620 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 385 transitions. [2022-07-12 19:25:59,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 19:25:59,620 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 385 transitions. [2022-07-12 19:25:59,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-12 19:25:59,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:59,621 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:59,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 19:25:59,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-07-12 19:25:59,836 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:59,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:59,836 INFO L85 PathProgramCache]: Analyzing trace with hash -2141054115, now seen corresponding path program 1 times [2022-07-12 19:25:59,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:59,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181529735] [2022-07-12 19:25:59,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:59,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 19:25:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:25:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 19:25:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 19:25:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 19:25:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 19:25:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:25:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,947 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-12 19:25:59,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:59,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181529735] [2022-07-12 19:25:59,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181529735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:59,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:59,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 19:25:59,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937579254] [2022-07-12 19:25:59,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:59,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:25:59,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:59,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:25:59,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:25:59,949 INFO L87 Difference]: Start difference. First operand 322 states and 385 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 19:26:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:00,295 INFO L93 Difference]: Finished difference Result 362 states and 442 transitions. [2022-07-12 19:26:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:26:00,296 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 134 [2022-07-12 19:26:00,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:00,296 INFO L225 Difference]: With dead ends: 362 [2022-07-12 19:26:00,296 INFO L226 Difference]: Without dead ends: 362 [2022-07-12 19:26:00,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:26:00,297 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 138 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:00,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 968 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:26:00,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-07-12 19:26:00,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 315. [2022-07-12 19:26:00,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 251 states have (on average 1.1155378486055776) internal successors, (280), 256 states have internal predecessors, (280), 39 states have call successors, (39), 21 states have call predecessors, (39), 24 states have return successors, (51), 37 states have call predecessors, (51), 36 states have call successors, (51) [2022-07-12 19:26:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 370 transitions. [2022-07-12 19:26:00,301 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 370 transitions. Word has length 134 [2022-07-12 19:26:00,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:00,302 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 370 transitions. [2022-07-12 19:26:00,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 19:26:00,302 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 370 transitions. [2022-07-12 19:26:00,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-12 19:26:00,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:00,304 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:26:00,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-07-12 19:26:00,304 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:00,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:00,304 INFO L85 PathProgramCache]: Analyzing trace with hash 437867423, now seen corresponding path program 1 times [2022-07-12 19:26:00,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:00,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201781353] [2022-07-12 19:26:00,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:00,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 19:26:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:26:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:26:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 19:26:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 19:26:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:26:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:26:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 19:26:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 19:26:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:26:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:26:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 19:26:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 19:26:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:26:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:26:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-12 19:26:00,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:00,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201781353] [2022-07-12 19:26:00,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201781353] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:00,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:00,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 19:26:00,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892276539] [2022-07-12 19:26:00,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:00,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:26:00,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:00,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:26:00,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:26:00,431 INFO L87 Difference]: Start difference. First operand 315 states and 370 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 19:26:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:00,720 INFO L93 Difference]: Finished difference Result 317 states and 376 transitions. [2022-07-12 19:26:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:26:00,721 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 170 [2022-07-12 19:26:00,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:00,722 INFO L225 Difference]: With dead ends: 317 [2022-07-12 19:26:00,722 INFO L226 Difference]: Without dead ends: 317 [2022-07-12 19:26:00,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:26:00,723 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 123 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:00,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 913 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:26:00,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-07-12 19:26:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 217. [2022-07-12 19:26:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 176 states have (on average 1.1136363636363635) internal successors, (196), 178 states have internal predecessors, (196), 24 states have call successors, (24), 14 states have call predecessors, (24), 16 states have return successors, (30), 24 states have call predecessors, (30), 22 states have call successors, (30) [2022-07-12 19:26:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 250 transitions. [2022-07-12 19:26:00,726 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 250 transitions. Word has length 170 [2022-07-12 19:26:00,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:00,726 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 250 transitions. [2022-07-12 19:26:00,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 19:26:00,727 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 250 transitions. [2022-07-12 19:26:00,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-12 19:26:00,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:00,728 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:26:00,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-07-12 19:26:00,728 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:00,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:00,729 INFO L85 PathProgramCache]: Analyzing trace with hash 507971218, now seen corresponding path program 1 times [2022-07-12 19:26:00,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:00,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385031189] [2022-07-12 19:26:00,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:00,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 19:26:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:26:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:26:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 19:26:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 19:26:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:26:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:26:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 19:26:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 19:26:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:26:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:26:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 19:26:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 19:26:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:26:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 19:26:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,881 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-12 19:26:00,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:00,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385031189] [2022-07-12 19:26:00,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385031189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:00,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:00,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 19:26:00,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755439449] [2022-07-12 19:26:00,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:00,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:26:00,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:00,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:26:00,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:26:00,882 INFO L87 Difference]: Start difference. First operand 217 states and 250 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 19:26:01,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:01,115 INFO L93 Difference]: Finished difference Result 209 states and 241 transitions. [2022-07-12 19:26:01,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:26:01,116 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 173 [2022-07-12 19:26:01,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:01,116 INFO L225 Difference]: With dead ends: 209 [2022-07-12 19:26:01,116 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 19:26:01,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:26:01,116 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 98 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:01,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 667 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:26:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 19:26:01,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 19:26:01,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 19:26:01,117 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 173 [2022-07-12 19:26:01,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:01,117 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 19:26:01,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 19:26:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 19:26:01,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 19:26:01,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-07-12 19:26:01,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-07-12 19:26:01,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-07-12 19:26:01,122 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:26:01,123 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 19:26:01,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 07:26:01 BoogieIcfgContainer [2022-07-12 19:26:01,125 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 19:26:01,125 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 19:26:01,125 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 19:26:01,125 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 19:26:01,126 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:25:40" (3/4) ... [2022-07-12 19:26:01,127 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 19:26:01,132 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2022-07-12 19:26:01,132 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2022-07-12 19:26:01,132 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfForwardIrpSynchronous [2022-07-12 19:26:01,132 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2022-07-12 19:26:01,132 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2022-07-12 19:26:01,132 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2022-07-12 19:26:01,132 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIrpCompletion [2022-07-12 19:26:01,132 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2022-07-12 19:26:01,133 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIoCompletion [2022-07-12 19:26:01,141 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2022-07-12 19:26:01,142 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-07-12 19:26:01,143 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-12 19:26:01,144 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 19:26:01,205 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 19:26:01,207 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 19:26:01,208 INFO L158 Benchmark]: Toolchain (without parser) took 21793.56ms. Allocated memory was 109.1MB in the beginning and 262.1MB in the end (delta: 153.1MB). Free memory was 73.2MB in the beginning and 96.1MB in the end (delta: -22.9MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. [2022-07-12 19:26:01,208 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory was 80.8MB in the beginning and 80.8MB in the end (delta: 26.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:26:01,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.95ms. Allocated memory is still 109.1MB. Free memory was 72.9MB in the beginning and 74.2MB in the end (delta: -1.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 19:26:01,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.91ms. Allocated memory is still 109.1MB. Free memory was 74.2MB in the beginning and 69.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 19:26:01,209 INFO L158 Benchmark]: Boogie Preprocessor took 62.13ms. Allocated memory is still 109.1MB. Free memory was 69.5MB in the beginning and 66.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 19:26:01,209 INFO L158 Benchmark]: RCFGBuilder took 724.49ms. Allocated memory is still 109.1MB. Free memory was 66.3MB in the beginning and 65.6MB in the end (delta: 726.3kB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2022-07-12 19:26:01,209 INFO L158 Benchmark]: TraceAbstraction took 20490.80ms. Allocated memory was 109.1MB in the beginning and 262.1MB in the end (delta: 153.1MB). Free memory was 65.1MB in the beginning and 110.8MB in the end (delta: -45.7MB). Peak memory consumption was 107.4MB. Max. memory is 16.1GB. [2022-07-12 19:26:01,209 INFO L158 Benchmark]: Witness Printer took 82.51ms. Allocated memory is still 262.1MB. Free memory was 110.8MB in the beginning and 96.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 19:26:01,214 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.19ms. Allocated memory is still 109.1MB. Free memory was 80.8MB in the beginning and 80.8MB in the end (delta: 26.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.95ms. Allocated memory is still 109.1MB. Free memory was 72.9MB in the beginning and 74.2MB in the end (delta: -1.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.91ms. Allocated memory is still 109.1MB. Free memory was 74.2MB in the beginning and 69.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.13ms. Allocated memory is still 109.1MB. Free memory was 69.5MB in the beginning and 66.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 724.49ms. Allocated memory is still 109.1MB. Free memory was 66.3MB in the beginning and 65.6MB in the end (delta: 726.3kB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20490.80ms. Allocated memory was 109.1MB in the beginning and 262.1MB in the end (delta: 153.1MB). Free memory was 65.1MB in the beginning and 110.8MB in the end (delta: -45.7MB). Peak memory consumption was 107.4MB. Max. memory is 16.1GB. * Witness Printer took 82.51ms. Allocated memory is still 262.1MB. Free memory was 110.8MB in the beginning and 96.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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 - PositiveResult [Line: 56]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 647]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 244 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 20.4s, OverallIterations: 51, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10919 SdHoareTripleChecker+Valid, 11.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10671 mSDsluCounter, 59256 SdHoareTripleChecker+Invalid, 9.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45102 mSDsCounter, 2996 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23911 IncrementalHoareTripleChecker+Invalid, 26907 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2996 mSolverCounterUnsat, 14154 mSDtfsCounter, 23911 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1045 GetRequests, 495 SyntacticMatches, 3 SemanticMatches, 547 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1197occurred in iteration=30, InterpolantAutomatonStates: 500, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 51 MinimizatonAttempts, 5084 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2987 NumberOfCodeBlocks, 2987 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 2935 ConstructedInterpolants, 0 QuantifiedInterpolants, 7423 SizeOfPredicates, 1 NumberOfNonLiveVariables, 868 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 52 InterpolantComputations, 51 PerfectInterpolantSequences, 552/558 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-07-12 19:26:01,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE