./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 75fd132a1a39ad1f2927845122893235fdf65fe2225472c79a2e84525dcd60fe --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:25:35,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:25:35,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:25:35,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:25:35,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:25:35,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:25:35,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:25:35,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:25:35,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:25:35,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:25:35,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:25:35,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:25:35,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:25:35,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:25:35,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:25:35,174 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:25:35,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:25:35,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:25:35,177 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:25:35,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:25:35,183 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:25:35,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:25:35,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:25:35,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:25:35,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:25:35,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:25:35,188 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:25:35,189 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:25:35,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:25:35,190 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:25:35,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:25:35,191 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:25:35,192 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:25:35,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:25:35,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:25:35,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:25:35,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:25:35,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:25:35,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:25:35,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:25:35,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:25:35,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:25:35,197 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:35,222 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:25:35,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:25:35,222 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:25:35,222 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:25:35,222 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:25:35,223 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:25:35,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:25:35,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:25:35,223 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:25:35,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:25:35,223 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:25:35,223 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:25:35,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:25:35,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:25:35,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:25:35,224 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:25:35,224 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:25:35,224 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:25:35,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:25:35,224 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:25:35,224 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:25:35,224 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:25:35,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:25:35,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:25:35,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:25:35,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:25:35,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:25:35,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:25:35,225 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 19:25:35,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 19:25:35,225 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 -> 75fd132a1a39ad1f2927845122893235fdf65fe2225472c79a2e84525dcd60fe [2022-07-12 19:25:35,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:25:35,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:25:35,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:25:35,417 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:25:35,417 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:25:35,418 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2022-07-12 19:25:35,454 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a280d6c70/65014dd3ea134cfc9d77b659812bd0f8/FLAG08af1d46f [2022-07-12 19:25:35,820 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:25:35,820 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2022-07-12 19:25:35,833 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a280d6c70/65014dd3ea134cfc9d77b659812bd0f8/FLAG08af1d46f [2022-07-12 19:25:36,182 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a280d6c70/65014dd3ea134cfc9d77b659812bd0f8 [2022-07-12 19:25:36,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:25:36,185 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:25:36,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:25:36,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:25:36,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:25:36,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:25:36" (1/1) ... [2022-07-12 19:25:36,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59bb28a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:25:36, skipping insertion in model container [2022-07-12 19:25:36,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:25:36" (1/1) ... [2022-07-12 19:25:36,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:25:36,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:25:36,371 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/cdaudio_simpl1.cil-2.c[2073,2086] [2022-07-12 19:25:36,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:25:36,502 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:25:36,511 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/cdaudio_simpl1.cil-2.c[2073,2086] [2022-07-12 19:25:36,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:25:36,590 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:25:36,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:25:36 WrapperNode [2022-07-12 19:25:36,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:25:36,591 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:25:36,591 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:25:36,591 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:25:36,599 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:36" (1/1) ... [2022-07-12 19:25:36,620 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:36" (1/1) ... [2022-07-12 19:25:36,671 INFO L137 Inliner]: procedures = 41, calls = 107, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 1581 [2022-07-12 19:25:36,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:25:36,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:25:36,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:25:36,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:25:36,681 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:36" (1/1) ... [2022-07-12 19:25:36,681 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:36" (1/1) ... [2022-07-12 19:25:36,688 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:36" (1/1) ... [2022-07-12 19:25:36,689 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:36" (1/1) ... [2022-07-12 19:25:36,714 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:36" (1/1) ... [2022-07-12 19:25:36,726 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:36" (1/1) ... [2022-07-12 19:25:36,731 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:36" (1/1) ... [2022-07-12 19:25:36,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:25:36,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:25:36,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:25:36,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:25:36,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:25:36" (1/1) ... [2022-07-12 19:25:36,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:25:36,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:25:36,797 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:36,803 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:36,823 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-07-12 19:25:36,823 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-07-12 19:25:36,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:25:36,823 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2022-07-12 19:25:36,823 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2022-07-12 19:25:36,823 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-12 19:25:36,824 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-12 19:25:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-07-12 19:25:36,824 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-07-12 19:25:36,824 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-07-12 19:25:36,824 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-07-12 19:25:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-12 19:25:36,825 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-12 19:25:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-07-12 19:25:36,825 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-07-12 19:25:36,825 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-07-12 19:25:36,825 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-07-12 19:25:36,826 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-07-12 19:25:36,826 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-07-12 19:25:36,826 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-12 19:25:36,826 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-12 19:25:36,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 19:25:36,826 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-12 19:25:36,826 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-12 19:25:36,826 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-07-12 19:25:36,827 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-07-12 19:25:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:25:36,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:25:36,827 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-07-12 19:25:36,827 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-07-12 19:25:37,057 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:25:37,058 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:25:37,132 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:25:37,178 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-07-12 19:25:37,178 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-07-12 19:25:37,229 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:25:37,246 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-07-12 19:25:37,246 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-07-12 19:25:37,259 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:25:37,261 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:25:37,263 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:25:37,274 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:25:37,283 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:25:37,285 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:25:37,286 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 19:25:37,634 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: CdAudioPnp_#res#1 := 0; [2022-07-12 19:25:37,634 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##258: assume !false; [2022-07-12 19:25:37,634 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##257: assume false; [2022-07-12 19:25:37,634 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##286: assume !false; [2022-07-12 19:25:37,634 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume false; [2022-07-12 19:25:37,634 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2022-07-12 19:25:37,634 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2022-07-12 19:25:37,634 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##133: assume false; [2022-07-12 19:25:37,634 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##134: assume !false; [2022-07-12 19:25:37,634 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2022-07-12 19:25:37,635 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2022-07-12 19:25:37,635 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-07-12 19:25:37,635 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-07-12 19:25:37,635 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2022-07-12 19:25:37,635 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2022-07-12 19:25:37,656 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:25:37,666 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:25:37,666 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 19:25:37,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:25:37 BoogieIcfgContainer [2022-07-12 19:25:37,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:25:37,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:25:37,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:25:37,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:25:37,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:25:36" (1/3) ... [2022-07-12 19:25:37,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5dd5c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:25:37, skipping insertion in model container [2022-07-12 19:25:37,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:25:36" (2/3) ... [2022-07-12 19:25:37,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5dd5c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:25:37, skipping insertion in model container [2022-07-12 19:25:37,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:25:37" (3/3) ... [2022-07-12 19:25:37,675 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-2.c [2022-07-12 19:25:37,685 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:25:37,686 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 19:25:37,744 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:25:37,749 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@227448f8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@52a2554b [2022-07-12 19:25:37,750 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-12 19:25:37,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 469 states, 367 states have (on average 1.5095367847411445) internal successors, (554), 386 states have internal predecessors, (554), 86 states have call successors, (86), 13 states have call predecessors, (86), 13 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2022-07-12 19:25:37,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 19:25:37,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:37,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:37,761 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:37,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:37,764 INFO L85 PathProgramCache]: Analyzing trace with hash 2107937654, now seen corresponding path program 1 times [2022-07-12 19:25:37,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:37,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404466254] [2022-07-12 19:25:37,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:37,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:37,902 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:37,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:37,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404466254] [2022-07-12 19:25:37,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404466254] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:37,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:37,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:25:37,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661086434] [2022-07-12 19:25:37,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:37,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:25:37,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:37,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:25:37,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:37,932 INFO L87 Difference]: Start difference. First operand has 469 states, 367 states have (on average 1.5095367847411445) internal successors, (554), 386 states have internal predecessors, (554), 86 states have call successors, (86), 13 states have call predecessors, (86), 13 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) 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:38,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:38,031 INFO L93 Difference]: Finished difference Result 621 states and 922 transitions. [2022-07-12 19:25:38,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:25:38,034 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:38,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:38,044 INFO L225 Difference]: With dead ends: 621 [2022-07-12 19:25:38,044 INFO L226 Difference]: Without dead ends: 617 [2022-07-12 19:25:38,046 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:38,048 INFO L413 NwaCegarLoop]: 727 mSDtfsCounter, 690 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:38,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 946 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:25:38,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-07-12 19:25:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 601. [2022-07-12 19:25:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 485 states have (on average 1.4721649484536083) internal successors, (714), 492 states have internal predecessors, (714), 93 states have call successors, (93), 18 states have call predecessors, (93), 21 states have return successors, (94), 94 states have call predecessors, (94), 79 states have call successors, (94) [2022-07-12 19:25:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 901 transitions. [2022-07-12 19:25:38,126 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 901 transitions. Word has length 8 [2022-07-12 19:25:38,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:38,126 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 901 transitions. [2022-07-12 19:25:38,127 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:38,127 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 901 transitions. [2022-07-12 19:25:38,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 19:25:38,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:38,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:38,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 19:25:38,128 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:38,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:38,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1313128949, now seen corresponding path program 1 times [2022-07-12 19:25:38,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:38,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953139466] [2022-07-12 19:25:38,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:38,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:38,173 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:38,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:38,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953139466] [2022-07-12 19:25:38,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953139466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:38,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:38,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:25:38,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112948356] [2022-07-12 19:25:38,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:38,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:25:38,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:38,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:25:38,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:38,176 INFO L87 Difference]: Start difference. First operand 601 states and 901 transitions. Second operand has 3 states, 3 states have (on average 3.0) 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:38,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:38,209 INFO L93 Difference]: Finished difference Result 603 states and 901 transitions. [2022-07-12 19:25:38,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:25:38,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) 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:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:38,216 INFO L225 Difference]: With dead ends: 603 [2022-07-12 19:25:38,217 INFO L226 Difference]: Without dead ends: 603 [2022-07-12 19:25:38,219 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:38,221 INFO L413 NwaCegarLoop]: 701 mSDtfsCounter, 384 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:38,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 942 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:25:38,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-07-12 19:25:38,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-07-12 19:25:38,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 485 states have (on average 1.4701030927835053) internal successors, (713), 492 states have internal predecessors, (713), 93 states have call successors, (93), 18 states have call predecessors, (93), 21 states have return successors, (94), 94 states have call predecessors, (94), 79 states have call successors, (94) [2022-07-12 19:25:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 900 transitions. [2022-07-12 19:25:38,267 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 900 transitions. Word has length 9 [2022-07-12 19:25:38,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:38,268 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 900 transitions. [2022-07-12 19:25:38,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) 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:38,269 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 900 transitions. [2022-07-12 19:25:38,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 19:25:38,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:38,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:38,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 19:25:38,270 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:38,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:38,275 INFO L85 PathProgramCache]: Analyzing trace with hash 929451779, now seen corresponding path program 1 times [2022-07-12 19:25:38,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:38,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575722620] [2022-07-12 19:25:38,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:38,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:38,322 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:38,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:38,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575722620] [2022-07-12 19:25:38,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575722620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:38,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:38,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:25:38,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599817363] [2022-07-12 19:25:38,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:38,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:25:38,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:38,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:25:38,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:38,324 INFO L87 Difference]: Start difference. First operand 601 states and 900 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:38,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:38,401 INFO L93 Difference]: Finished difference Result 600 states and 899 transitions. [2022-07-12 19:25:38,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:25:38,402 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:38,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:38,405 INFO L225 Difference]: With dead ends: 600 [2022-07-12 19:25:38,405 INFO L226 Difference]: Without dead ends: 597 [2022-07-12 19:25:38,405 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:38,406 INFO L413 NwaCegarLoop]: 700 mSDtfsCounter, 416 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:38,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 847 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:25:38,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-07-12 19:25:38,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 591. [2022-07-12 19:25:38,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 476 states have (on average 1.4516806722689075) internal successors, (691), 482 states have internal predecessors, (691), 93 states have call successors, (93), 18 states have call predecessors, (93), 21 states have return successors, (94), 94 states have call predecessors, (94), 79 states have call successors, (94) [2022-07-12 19:25:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 878 transitions. [2022-07-12 19:25:38,426 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 878 transitions. Word has length 9 [2022-07-12 19:25:38,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:38,426 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 878 transitions. [2022-07-12 19:25:38,427 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:38,427 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 878 transitions. [2022-07-12 19:25:38,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 19:25:38,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:38,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:38,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 19:25:38,428 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:38,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:38,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1469618303, now seen corresponding path program 1 times [2022-07-12 19:25:38,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:38,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345727145] [2022-07-12 19:25:38,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:38,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:38,454 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:38,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:38,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345727145] [2022-07-12 19:25:38,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345727145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:38,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:38,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:25:38,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337088397] [2022-07-12 19:25:38,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:38,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:25:38,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:38,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:25:38,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:38,456 INFO L87 Difference]: Start difference. First operand 591 states and 878 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:38,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:38,499 INFO L93 Difference]: Finished difference Result 594 states and 880 transitions. [2022-07-12 19:25:38,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:25:38,500 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:38,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:38,503 INFO L225 Difference]: With dead ends: 594 [2022-07-12 19:25:38,503 INFO L226 Difference]: Without dead ends: 591 [2022-07-12 19:25:38,503 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:38,504 INFO L413 NwaCegarLoop]: 690 mSDtfsCounter, 0 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:38,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1329 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:25:38,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-07-12 19:25:38,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2022-07-12 19:25:38,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 476 states have (on average 1.449579831932773) internal successors, (690), 482 states have internal predecessors, (690), 93 states have call successors, (93), 18 states have call predecessors, (93), 21 states have return successors, (94), 94 states have call predecessors, (94), 79 states have call successors, (94) [2022-07-12 19:25:38,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 877 transitions. [2022-07-12 19:25:38,521 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 877 transitions. Word has length 13 [2022-07-12 19:25:38,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:38,522 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 877 transitions. [2022-07-12 19:25:38,522 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:38,522 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 877 transitions. [2022-07-12 19:25:38,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 19:25:38,523 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:38,523 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:38,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 19:25:38,523 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:38,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:38,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1712839995, now seen corresponding path program 1 times [2022-07-12 19:25:38,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:38,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444335055] [2022-07-12 19:25:38,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:38,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:38,554 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:38,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:38,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444335055] [2022-07-12 19:25:38,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444335055] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:38,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:38,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:25:38,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362646206] [2022-07-12 19:25:38,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:38,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:25:38,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:38,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:25:38,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:38,556 INFO L87 Difference]: Start difference. First operand 591 states and 877 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:38,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:38,677 INFO L93 Difference]: Finished difference Result 835 states and 1220 transitions. [2022-07-12 19:25:38,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:25:38,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 15 [2022-07-12 19:25:38,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:38,682 INFO L225 Difference]: With dead ends: 835 [2022-07-12 19:25:38,682 INFO L226 Difference]: Without dead ends: 834 [2022-07-12 19:25:38,682 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:38,683 INFO L413 NwaCegarLoop]: 820 mSDtfsCounter, 564 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:38,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1042 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:25:38,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-07-12 19:25:38,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 791. [2022-07-12 19:25:38,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 649 states have (on average 1.4206471494607087) internal successors, (922), 641 states have internal predecessors, (922), 106 states have call successors, (106), 31 states have call predecessors, (106), 35 states have return successors, (136), 122 states have call predecessors, (136), 96 states have call successors, (136) [2022-07-12 19:25:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1164 transitions. [2022-07-12 19:25:38,716 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1164 transitions. Word has length 15 [2022-07-12 19:25:38,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:38,716 INFO L495 AbstractCegarLoop]: Abstraction has 791 states and 1164 transitions. [2022-07-12 19:25:38,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:38,716 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1164 transitions. [2022-07-12 19:25:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 19:25:38,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:38,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:38,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 19:25:38,722 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:38,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:38,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1752786185, now seen corresponding path program 1 times [2022-07-12 19:25:38,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:38,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556709853] [2022-07-12 19:25:38,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:38,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:38,770 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:38,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:38,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556709853] [2022-07-12 19:25:38,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556709853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:38,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:38,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:25:38,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717499823] [2022-07-12 19:25:38,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:38,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:25:38,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:38,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:25:38,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:38,771 INFO L87 Difference]: Start difference. First operand 791 states and 1164 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:38,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:38,795 INFO L93 Difference]: Finished difference Result 867 states and 1260 transitions. [2022-07-12 19:25:38,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:25:38,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2022-07-12 19:25:38,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:38,798 INFO L225 Difference]: With dead ends: 867 [2022-07-12 19:25:38,798 INFO L226 Difference]: Without dead ends: 867 [2022-07-12 19:25:38,798 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:38,799 INFO L413 NwaCegarLoop]: 679 mSDtfsCounter, 601 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:38,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 864 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:25:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2022-07-12 19:25:38,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 839. [2022-07-12 19:25:38,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 692 states have (on average 1.439306358381503) internal successors, (996), 695 states have internal predecessors, (996), 105 states have call successors, (105), 35 states have call predecessors, (105), 41 states have return successors, (127), 108 states have call predecessors, (127), 98 states have call successors, (127) [2022-07-12 19:25:38,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1228 transitions. [2022-07-12 19:25:38,817 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1228 transitions. Word has length 19 [2022-07-12 19:25:38,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:38,818 INFO L495 AbstractCegarLoop]: Abstraction has 839 states and 1228 transitions. [2022-07-12 19:25:38,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:38,818 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1228 transitions. [2022-07-12 19:25:38,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 19:25:38,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:38,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:38,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 19:25:38,820 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:38,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:38,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1868596178, now seen corresponding path program 1 times [2022-07-12 19:25:38,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:38,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036827780] [2022-07-12 19:25:38,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:38,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:38,841 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:38,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:38,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036827780] [2022-07-12 19:25:38,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036827780] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:38,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:38,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:25:38,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653396285] [2022-07-12 19:25:38,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:38,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:25:38,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:38,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:25:38,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:38,843 INFO L87 Difference]: Start difference. First operand 839 states and 1228 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:38,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:38,931 INFO L93 Difference]: Finished difference Result 1332 states and 2008 transitions. [2022-07-12 19:25:38,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:25:38,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 21 [2022-07-12 19:25:38,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:38,938 INFO L225 Difference]: With dead ends: 1332 [2022-07-12 19:25:38,938 INFO L226 Difference]: Without dead ends: 1332 [2022-07-12 19:25:38,940 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:38,941 INFO L413 NwaCegarLoop]: 1002 mSDtfsCounter, 336 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:38,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1616 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:25:38,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2022-07-12 19:25:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1027. [2022-07-12 19:25:38,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 848 states have (on average 1.4375) internal successors, (1219), 849 states have internal predecessors, (1219), 122 states have call successors, (122), 47 states have call predecessors, (122), 56 states have return successors, (205), 130 states have call predecessors, (205), 115 states have call successors, (205) [2022-07-12 19:25:38,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1546 transitions. [2022-07-12 19:25:38,968 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1546 transitions. Word has length 21 [2022-07-12 19:25:38,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:38,971 INFO L495 AbstractCegarLoop]: Abstraction has 1027 states and 1546 transitions. [2022-07-12 19:25:38,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:38,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1546 transitions. [2022-07-12 19:25:38,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:25:38,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:38,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:38,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 19:25:38,973 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:38,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:38,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1853359414, now seen corresponding path program 1 times [2022-07-12 19:25:38,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:38,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280922115] [2022-07-12 19:25:38,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:38,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:39,068 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:39,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:39,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280922115] [2022-07-12 19:25:39,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280922115] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:39,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:39,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:25:39,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550765613] [2022-07-12 19:25:39,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:39,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:25:39,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:39,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:25:39,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:25:39,071 INFO L87 Difference]: Start difference. First operand 1027 states and 1546 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:39,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:39,328 INFO L93 Difference]: Finished difference Result 1060 states and 1579 transitions. [2022-07-12 19:25:39,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:25:39,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 22 [2022-07-12 19:25:39,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:39,333 INFO L225 Difference]: With dead ends: 1060 [2022-07-12 19:25:39,333 INFO L226 Difference]: Without dead ends: 1060 [2022-07-12 19:25:39,333 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:39,334 INFO L413 NwaCegarLoop]: 716 mSDtfsCounter, 1024 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:39,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 868 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2022-07-12 19:25:39,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1009. [2022-07-12 19:25:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 833 states have (on average 1.4309723889555823) internal successors, (1192), 834 states have internal predecessors, (1192), 119 states have call successors, (119), 44 states have call predecessors, (119), 56 states have return successors, (199), 130 states have call predecessors, (199), 112 states have call successors, (199) [2022-07-12 19:25:39,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1510 transitions. [2022-07-12 19:25:39,355 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1510 transitions. Word has length 22 [2022-07-12 19:25:39,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:39,356 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 1510 transitions. [2022-07-12 19:25:39,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:39,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1510 transitions. [2022-07-12 19:25:39,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 19:25:39,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:39,357 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] [2022-07-12 19:25:39,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 19:25:39,358 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:39,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:39,358 INFO L85 PathProgramCache]: Analyzing trace with hash -401986613, now seen corresponding path program 1 times [2022-07-12 19:25:39,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:39,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143663593] [2022-07-12 19:25:39,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:39,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:39,384 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:39,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:39,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143663593] [2022-07-12 19:25:39,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143663593] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:39,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:39,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:25:39,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547970792] [2022-07-12 19:25:39,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:39,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:25:39,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:39,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:25:39,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:39,387 INFO L87 Difference]: Start difference. First operand 1009 states and 1510 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:39,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:39,425 INFO L93 Difference]: Finished difference Result 1008 states and 1507 transitions. [2022-07-12 19:25:39,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:25:39,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 23 [2022-07-12 19:25:39,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:39,428 INFO L225 Difference]: With dead ends: 1008 [2022-07-12 19:25:39,428 INFO L226 Difference]: Without dead ends: 1008 [2022-07-12 19:25:39,429 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:39,430 INFO L413 NwaCegarLoop]: 647 mSDtfsCounter, 22 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:39,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1248 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:25:39,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2022-07-12 19:25:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1008. [2022-07-12 19:25:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 833 states have (on average 1.4285714285714286) internal successors, (1190), 833 states have internal predecessors, (1190), 118 states have call successors, (118), 44 states have call predecessors, (118), 56 states have return successors, (199), 130 states have call predecessors, (199), 112 states have call successors, (199) [2022-07-12 19:25:39,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1507 transitions. [2022-07-12 19:25:39,457 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1507 transitions. Word has length 23 [2022-07-12 19:25:39,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:39,457 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 1507 transitions. [2022-07-12 19:25:39,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:39,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1507 transitions. [2022-07-12 19:25:39,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 19:25:39,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:39,459 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:39,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 19:25:39,459 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:39,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:39,460 INFO L85 PathProgramCache]: Analyzing trace with hash -411805955, now seen corresponding path program 1 times [2022-07-12 19:25:39,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:39,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607001150] [2022-07-12 19:25:39,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:39,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:39,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 19:25:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:39,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:39,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607001150] [2022-07-12 19:25:39,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607001150] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:39,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:39,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:25:39,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532923980] [2022-07-12 19:25:39,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:39,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:25:39,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:39,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:25:39,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:25:39,500 INFO L87 Difference]: Start difference. First operand 1008 states and 1507 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:39,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:39,675 INFO L93 Difference]: Finished difference Result 1305 states and 1930 transitions. [2022-07-12 19:25:39,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:25:39,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 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:39,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:39,680 INFO L225 Difference]: With dead ends: 1305 [2022-07-12 19:25:39,680 INFO L226 Difference]: Without dead ends: 1305 [2022-07-12 19:25:39,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:39,681 INFO L413 NwaCegarLoop]: 709 mSDtfsCounter, 768 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:39,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1360 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:25:39,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2022-07-12 19:25:39,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1065. [2022-07-12 19:25:39,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 881 states have (on average 1.41316685584563) internal successors, (1245), 886 states have internal predecessors, (1245), 115 states have call successors, (115), 49 states have call predecessors, (115), 68 states have return successors, (178), 129 states have call predecessors, (178), 109 states have call successors, (178) [2022-07-12 19:25:39,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1538 transitions. [2022-07-12 19:25:39,708 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1538 transitions. Word has length 36 [2022-07-12 19:25:39,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:39,709 INFO L495 AbstractCegarLoop]: Abstraction has 1065 states and 1538 transitions. [2022-07-12 19:25:39,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:25:39,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1538 transitions. [2022-07-12 19:25:39,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 19:25:39,712 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:39,713 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:39,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 19:25:39,713 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:39,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:39,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2014058946, now seen corresponding path program 1 times [2022-07-12 19:25:39,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:39,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781485109] [2022-07-12 19:25:39,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:39,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:39,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 19:25:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:39,746 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:39,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:39,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781485109] [2022-07-12 19:25:39,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781485109] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:39,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:39,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:25:39,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597520293] [2022-07-12 19:25:39,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:39,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:25:39,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:39,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:25:39,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:25:39,748 INFO L87 Difference]: Start difference. First operand 1065 states and 1538 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 4 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:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:39,926 INFO L93 Difference]: Finished difference Result 836 states and 1213 transitions. [2022-07-12 19:25:39,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:25:39,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 4 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 35 [2022-07-12 19:25:39,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:39,929 INFO L225 Difference]: With dead ends: 836 [2022-07-12 19:25:39,929 INFO L226 Difference]: Without dead ends: 836 [2022-07-12 19:25:39,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:39,930 INFO L413 NwaCegarLoop]: 723 mSDtfsCounter, 248 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:39,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 1763 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2022-07-12 19:25:39,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 797. [2022-07-12 19:25:39,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 659 states have (on average 1.4142640364188164) internal successors, (932), 666 states have internal predecessors, (932), 93 states have call successors, (93), 33 states have call predecessors, (93), 44 states have return successors, (121), 97 states have call predecessors, (121), 87 states have call successors, (121) [2022-07-12 19:25:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1146 transitions. [2022-07-12 19:25:39,946 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1146 transitions. Word has length 35 [2022-07-12 19:25:39,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:39,946 INFO L495 AbstractCegarLoop]: Abstraction has 797 states and 1146 transitions. [2022-07-12 19:25:39,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 4 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:39,946 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1146 transitions. [2022-07-12 19:25:39,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 19:25:39,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:39,948 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] [2022-07-12 19:25:39,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 19:25:39,948 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:39,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:39,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1008894196, now seen corresponding path program 1 times [2022-07-12 19:25:39,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:39,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286853799] [2022-07-12 19:25:39,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:39,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:39,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:39,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:39,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286853799] [2022-07-12 19:25:39,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286853799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:39,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:39,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:25:39,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141255249] [2022-07-12 19:25:39,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:39,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:25:39,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:39,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:25:39,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:25:39,973 INFO L87 Difference]: Start difference. First operand 797 states and 1146 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:40,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:40,163 INFO L93 Difference]: Finished difference Result 813 states and 1164 transitions. [2022-07-12 19:25:40,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:25:40,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 32 [2022-07-12 19:25:40,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:40,166 INFO L225 Difference]: With dead ends: 813 [2022-07-12 19:25:40,166 INFO L226 Difference]: Without dead ends: 813 [2022-07-12 19:25:40,166 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:40,167 INFO L413 NwaCegarLoop]: 640 mSDtfsCounter, 690 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:40,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1099 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:40,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2022-07-12 19:25:40,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 797. [2022-07-12 19:25:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 659 states have (on average 1.4112291350531108) internal successors, (930), 666 states have internal predecessors, (930), 93 states have call successors, (93), 33 states have call predecessors, (93), 44 states have return successors, (121), 97 states have call predecessors, (121), 87 states have call successors, (121) [2022-07-12 19:25:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1144 transitions. [2022-07-12 19:25:40,180 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1144 transitions. Word has length 32 [2022-07-12 19:25:40,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:40,180 INFO L495 AbstractCegarLoop]: Abstraction has 797 states and 1144 transitions. [2022-07-12 19:25:40,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:40,181 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1144 transitions. [2022-07-12 19:25:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 19:25:40,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:40,182 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:40,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 19:25:40,182 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:40,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:40,183 INFO L85 PathProgramCache]: Analyzing trace with hash -509252101, now seen corresponding path program 1 times [2022-07-12 19:25:40,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:40,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335599440] [2022-07-12 19:25:40,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:40,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:40,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 19:25:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:40,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:40,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:40,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335599440] [2022-07-12 19:25:40,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335599440] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:40,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:40,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:25:40,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574540390] [2022-07-12 19:25:40,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:40,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:25:40,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:40,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:25:40,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:25:40,216 INFO L87 Difference]: Start difference. First operand 797 states and 1144 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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:40,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:40,606 INFO L93 Difference]: Finished difference Result 706 states and 1022 transitions. [2022-07-12 19:25:40,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:25:40,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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 36 [2022-07-12 19:25:40,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:40,609 INFO L225 Difference]: With dead ends: 706 [2022-07-12 19:25:40,609 INFO L226 Difference]: Without dead ends: 706 [2022-07-12 19:25:40,609 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:40,610 INFO L413 NwaCegarLoop]: 711 mSDtfsCounter, 843 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:40,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 1645 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:25:40,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2022-07-12 19:25:40,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 665. [2022-07-12 19:25:40,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 548 states have (on average 1.4087591240875912) internal successors, (772), 554 states have internal predecessors, (772), 85 states have call successors, (85), 26 states have call predecessors, (85), 31 states have return successors, (96), 84 states have call predecessors, (96), 79 states have call successors, (96) [2022-07-12 19:25:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 953 transitions. [2022-07-12 19:25:40,621 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 953 transitions. Word has length 36 [2022-07-12 19:25:40,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:40,621 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 953 transitions. [2022-07-12 19:25:40,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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:40,621 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 953 transitions. [2022-07-12 19:25:40,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:25:40,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:40,622 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:40,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 19:25:40,623 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:40,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:40,623 INFO L85 PathProgramCache]: Analyzing trace with hash 138801863, now seen corresponding path program 1 times [2022-07-12 19:25:40,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:40,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629218934] [2022-07-12 19:25:40,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:40,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:40,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:40,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629218934] [2022-07-12 19:25:40,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629218934] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:40,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:40,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:25:40,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370309155] [2022-07-12 19:25:40,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:40,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:25:40,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:40,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:25:40,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:25:40,648 INFO L87 Difference]: Start difference. First operand 665 states and 953 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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:40,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:40,692 INFO L93 Difference]: Finished difference Result 811 states and 1155 transitions. [2022-07-12 19:25:40,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:25:40,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:40,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:40,694 INFO L225 Difference]: With dead ends: 811 [2022-07-12 19:25:40,695 INFO L226 Difference]: Without dead ends: 811 [2022-07-12 19:25:40,695 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:40,695 INFO L413 NwaCegarLoop]: 771 mSDtfsCounter, 132 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:40,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1384 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:25:40,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2022-07-12 19:25:40,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 713. [2022-07-12 19:25:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 592 states have (on average 1.385135135135135) internal successors, (820), 591 states have internal predecessors, (820), 85 states have call successors, (85), 26 states have call predecessors, (85), 35 states have return successors, (107), 95 states have call predecessors, (107), 79 states have call successors, (107) [2022-07-12 19:25:40,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1012 transitions. [2022-07-12 19:25:40,707 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1012 transitions. Word has length 34 [2022-07-12 19:25:40,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:40,707 INFO L495 AbstractCegarLoop]: Abstraction has 713 states and 1012 transitions. [2022-07-12 19:25:40,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:40,707 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1012 transitions. [2022-07-12 19:25:40,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:25:40,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:40,709 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:40,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 19:25:40,709 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:40,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:40,710 INFO L85 PathProgramCache]: Analyzing trace with hash -298326267, now seen corresponding path program 1 times [2022-07-12 19:25:40,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:40,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585161293] [2022-07-12 19:25:40,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:40,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:40,757 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,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:40,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585161293] [2022-07-12 19:25:40,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585161293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:40,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:40,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:25:40,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319217950] [2022-07-12 19:25:40,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:40,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:25:40,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:40,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:25:40,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:25:40,758 INFO L87 Difference]: Start difference. First operand 713 states and 1012 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:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:40,953 INFO L93 Difference]: Finished difference Result 694 states and 982 transitions. [2022-07-12 19:25:40,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:25:40,954 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:40,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:40,956 INFO L225 Difference]: With dead ends: 694 [2022-07-12 19:25:40,957 INFO L226 Difference]: Without dead ends: 694 [2022-07-12 19:25:40,957 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:40,957 INFO L413 NwaCegarLoop]: 640 mSDtfsCounter, 670 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:40,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1099 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:40,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-07-12 19:25:40,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2022-07-12 19:25:40,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 575 states have (on average 1.3895652173913045) internal successors, (799), 581 states have internal predecessors, (799), 85 states have call successors, (85), 26 states have call predecessors, (85), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-12 19:25:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 982 transitions. [2022-07-12 19:25:40,968 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 982 transitions. Word has length 34 [2022-07-12 19:25:40,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:40,968 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 982 transitions. [2022-07-12 19:25:40,968 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:40,968 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 982 transitions. [2022-07-12 19:25:40,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 19:25:40,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:40,969 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:40,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 19:25:40,970 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:40,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:40,970 INFO L85 PathProgramCache]: Analyzing trace with hash 452395465, now seen corresponding path program 1 times [2022-07-12 19:25:40,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:40,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910639370] [2022-07-12 19:25:40,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:40,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:40,999 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,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:41,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910639370] [2022-07-12 19:25:41,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910639370] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:41,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:41,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:25:41,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141535265] [2022-07-12 19:25:41,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:41,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:25:41,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:41,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:25:41,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:25:41,001 INFO L87 Difference]: Start difference. First operand 694 states and 982 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:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:41,212 INFO L93 Difference]: Finished difference Result 788 states and 1120 transitions. [2022-07-12 19:25:41,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:25:41,213 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:41,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:41,215 INFO L225 Difference]: With dead ends: 788 [2022-07-12 19:25:41,215 INFO L226 Difference]: Without dead ends: 788 [2022-07-12 19:25:41,216 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:41,216 INFO L413 NwaCegarLoop]: 734 mSDtfsCounter, 743 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:41,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1190 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-07-12 19:25:41,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 696. [2022-07-12 19:25:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 577 states have (on average 1.3882149046793761) internal successors, (801), 583 states have internal predecessors, (801), 85 states have call successors, (85), 26 states have call predecessors, (85), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-12 19:25:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 984 transitions. [2022-07-12 19:25:41,226 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 984 transitions. Word has length 35 [2022-07-12 19:25:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:41,227 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 984 transitions. [2022-07-12 19:25:41,227 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:41,227 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 984 transitions. [2022-07-12 19:25:41,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 19:25:41,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:41,229 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:41,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 19:25:41,229 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:41,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:41,230 INFO L85 PathProgramCache]: Analyzing trace with hash 452672295, now seen corresponding path program 1 times [2022-07-12 19:25:41,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:41,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261007736] [2022-07-12 19:25:41,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:41,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:41,254 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,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:41,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261007736] [2022-07-12 19:25:41,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261007736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:41,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:41,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:25:41,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490451610] [2022-07-12 19:25:41,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:41,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:25:41,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:41,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:25:41,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:25:41,256 INFO L87 Difference]: Start difference. First operand 696 states and 984 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 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:41,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:41,305 INFO L93 Difference]: Finished difference Result 706 states and 994 transitions. [2022-07-12 19:25:41,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:25:41,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 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:41,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:41,307 INFO L225 Difference]: With dead ends: 706 [2022-07-12 19:25:41,307 INFO L226 Difference]: Without dead ends: 679 [2022-07-12 19:25:41,308 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:41,308 INFO L413 NwaCegarLoop]: 648 mSDtfsCounter, 38 mSDsluCounter, 2545 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3193 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:41,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3193 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:25:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-07-12 19:25:41,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2022-07-12 19:25:41,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 560 states have (on average 1.394642857142857) internal successors, (781), 566 states have internal predecessors, (781), 85 states have call successors, (85), 26 states have call predecessors, (85), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-12 19:25:41,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 964 transitions. [2022-07-12 19:25:41,319 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 964 transitions. Word has length 35 [2022-07-12 19:25:41,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:41,319 INFO L495 AbstractCegarLoop]: Abstraction has 679 states and 964 transitions. [2022-07-12 19:25:41,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 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:41,319 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 964 transitions. [2022-07-12 19:25:41,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:25:41,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:41,320 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:41,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 19:25:41,321 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:41,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:41,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1898283434, now seen corresponding path program 1 times [2022-07-12 19:25:41,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:41,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497759884] [2022-07-12 19:25:41,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:41,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:41,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 19:25:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:41,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:41,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497759884] [2022-07-12 19:25:41,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497759884] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:41,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:41,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:25:41,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120764807] [2022-07-12 19:25:41,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:41,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:25:41,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:41,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:25:41,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:25:41,345 INFO L87 Difference]: Start difference. First operand 679 states and 964 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 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:41,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:41,504 INFO L93 Difference]: Finished difference Result 712 states and 1022 transitions. [2022-07-12 19:25:41,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:25:41,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 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:41,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:41,507 INFO L225 Difference]: With dead ends: 712 [2022-07-12 19:25:41,507 INFO L226 Difference]: Without dead ends: 710 [2022-07-12 19:25:41,507 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:41,507 INFO L413 NwaCegarLoop]: 622 mSDtfsCounter, 150 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:41,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1540 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:25:41,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-07-12 19:25:41,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 692. [2022-07-12 19:25:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 573 states have (on average 1.3891797556719023) internal successors, (796), 579 states have internal predecessors, (796), 85 states have call successors, (85), 26 states have call predecessors, (85), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-12 19:25:41,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 979 transitions. [2022-07-12 19:25:41,519 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 979 transitions. Word has length 37 [2022-07-12 19:25:41,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:41,519 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 979 transitions. [2022-07-12 19:25:41,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 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:41,520 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 979 transitions. [2022-07-12 19:25:41,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:25:41,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:41,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:41,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 19:25:41,521 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:41,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:41,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1374369595, now seen corresponding path program 1 times [2022-07-12 19:25:41,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:41,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563467264] [2022-07-12 19:25:41,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:41,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:41,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 19:25:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:41,574 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,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:41,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563467264] [2022-07-12 19:25:41,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563467264] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:41,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:41,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:25:41,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322108430] [2022-07-12 19:25:41,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:41,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:25:41,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:41,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:25:41,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:25:41,576 INFO L87 Difference]: Start difference. First operand 692 states and 979 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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:41,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:41,909 INFO L93 Difference]: Finished difference Result 710 states and 1019 transitions. [2022-07-12 19:25:41,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:25:41,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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 39 [2022-07-12 19:25:41,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:41,912 INFO L225 Difference]: With dead ends: 710 [2022-07-12 19:25:41,912 INFO L226 Difference]: Without dead ends: 710 [2022-07-12 19:25:41,912 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:41,913 INFO L413 NwaCegarLoop]: 616 mSDtfsCounter, 745 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:41,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 1870 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:25:41,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-07-12 19:25:41,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 692. [2022-07-12 19:25:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 573 states have (on average 1.387434554973822) internal successors, (795), 579 states have internal predecessors, (795), 85 states have call successors, (85), 26 states have call predecessors, (85), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-12 19:25:41,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 978 transitions. [2022-07-12 19:25:41,923 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 978 transitions. Word has length 39 [2022-07-12 19:25:41,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:41,923 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 978 transitions. [2022-07-12 19:25:41,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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:41,924 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 978 transitions. [2022-07-12 19:25:41,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 19:25:41,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:41,925 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] [2022-07-12 19:25:41,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 19:25:41,925 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:41,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:41,926 INFO L85 PathProgramCache]: Analyzing trace with hash -31152669, now seen corresponding path program 1 times [2022-07-12 19:25:41,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:41,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625173492] [2022-07-12 19:25:41,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:41,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:41,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 19:25:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:41,964 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,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:41,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625173492] [2022-07-12 19:25:41,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625173492] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:41,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:41,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:25:41,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717109252] [2022-07-12 19:25:41,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:41,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:25:41,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:41,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:25:41,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:25:41,966 INFO L87 Difference]: Start difference. First operand 692 states and 978 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 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,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:42,238 INFO L93 Difference]: Finished difference Result 728 states and 1040 transitions. [2022-07-12 19:25:42,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:25:42,238 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 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 40 [2022-07-12 19:25:42,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:42,241 INFO L225 Difference]: With dead ends: 728 [2022-07-12 19:25:42,241 INFO L226 Difference]: Without dead ends: 699 [2022-07-12 19:25:42,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:25:42,241 INFO L413 NwaCegarLoop]: 618 mSDtfsCounter, 158 mSDsluCounter, 3340 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 3958 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:42,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 3958 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-07-12 19:25:42,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 683. [2022-07-12 19:25:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 566 states have (on average 1.3692579505300353) internal successors, (775), 572 states have internal predecessors, (775), 83 states have call successors, (83), 26 states have call predecessors, (83), 33 states have return successors, (96), 84 states have call predecessors, (96), 77 states have call successors, (96) [2022-07-12 19:25:42,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 954 transitions. [2022-07-12 19:25:42,256 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 954 transitions. Word has length 40 [2022-07-12 19:25:42,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:42,256 INFO L495 AbstractCegarLoop]: Abstraction has 683 states and 954 transitions. [2022-07-12 19:25:42,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 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,256 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 954 transitions. [2022-07-12 19:25:42,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 19:25:42,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:42,258 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:42,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 19:25:42,259 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:42,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:42,259 INFO L85 PathProgramCache]: Analyzing trace with hash 128291846, now seen corresponding path program 1 times [2022-07-12 19:25:42,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:42,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536782813] [2022-07-12 19:25:42,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:42,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:42,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 19:25:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:42,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 19:25:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:42,284 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,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:42,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536782813] [2022-07-12 19:25:42,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536782813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:42,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:42,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:25:42,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375303306] [2022-07-12 19:25:42,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:42,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:25:42,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:42,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:25:42,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:25:42,286 INFO L87 Difference]: Start difference. First operand 683 states and 954 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:42,632 INFO L93 Difference]: Finished difference Result 678 states and 964 transitions. [2022-07-12 19:25:42,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:25:42,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-07-12 19:25:42,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:42,635 INFO L225 Difference]: With dead ends: 678 [2022-07-12 19:25:42,635 INFO L226 Difference]: Without dead ends: 678 [2022-07-12 19:25:42,636 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:42,637 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 252 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:42,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1790 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:25:42,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-07-12 19:25:42,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 662. [2022-07-12 19:25:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 548 states have (on average 1.364963503649635) internal successors, (748), 553 states have internal predecessors, (748), 82 states have call successors, (82), 26 states have call predecessors, (82), 31 states have return successors, (94), 82 states have call predecessors, (94), 77 states have call successors, (94) [2022-07-12 19:25:42,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 924 transitions. [2022-07-12 19:25:42,649 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 924 transitions. Word has length 43 [2022-07-12 19:25:42,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:42,649 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 924 transitions. [2022-07-12 19:25:42,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:42,650 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 924 transitions. [2022-07-12 19:25:42,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:25:42,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:42,651 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:42,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 19:25:42,651 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:42,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:42,652 INFO L85 PathProgramCache]: Analyzing trace with hash -37716100, now seen corresponding path program 1 times [2022-07-12 19:25:42,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:42,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34384888] [2022-07-12 19:25:42,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:42,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:42,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 19:25:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:42,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:42,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:42,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:42,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34384888] [2022-07-12 19:25:42,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34384888] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:42,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:42,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 19:25:42,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549691630] [2022-07-12 19:25:42,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:42,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:25:42,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:42,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:25:42,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:25:42,784 INFO L87 Difference]: Start difference. First operand 662 states and 924 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:43,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:43,343 INFO L93 Difference]: Finished difference Result 689 states and 975 transitions. [2022-07-12 19:25:43,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:25:43,344 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-07-12 19:25:43,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:43,347 INFO L225 Difference]: With dead ends: 689 [2022-07-12 19:25:43,347 INFO L226 Difference]: Without dead ends: 676 [2022-07-12 19:25:43,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:25:43,347 INFO L413 NwaCegarLoop]: 608 mSDtfsCounter, 98 mSDsluCounter, 3829 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 4437 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:43,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 4437 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 19:25:43,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-07-12 19:25:43,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 660. [2022-07-12 19:25:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 547 states have (on average 1.363802559414991) internal successors, (746), 552 states have internal predecessors, (746), 81 states have call successors, (81), 26 states have call predecessors, (81), 31 states have return successors, (93), 81 states have call predecessors, (93), 76 states have call successors, (93) [2022-07-12 19:25:43,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 920 transitions. [2022-07-12 19:25:43,356 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 920 transitions. Word has length 44 [2022-07-12 19:25:43,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:43,356 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 920 transitions. [2022-07-12 19:25:43,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:43,357 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 920 transitions. [2022-07-12 19:25:43,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 19:25:43,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:43,358 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:43,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 19:25:43,358 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:43,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:43,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1983772567, now seen corresponding path program 1 times [2022-07-12 19:25:43,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:43,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854073586] [2022-07-12 19:25:43,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:43,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:43,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:25:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:43,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:43,469 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,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:43,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854073586] [2022-07-12 19:25:43,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854073586] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:43,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:43,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 19:25:43,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333958893] [2022-07-12 19:25:43,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:43,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:25:43,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:43,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:25:43,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:25:43,471 INFO L87 Difference]: Start difference. First operand 660 states and 920 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:43,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:43,997 INFO L93 Difference]: Finished difference Result 686 states and 970 transitions. [2022-07-12 19:25:43,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:25:43,997 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-07-12 19:25:43,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:44,000 INFO L225 Difference]: With dead ends: 686 [2022-07-12 19:25:44,000 INFO L226 Difference]: Without dead ends: 673 [2022-07-12 19:25:44,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:25:44,001 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 98 mSDsluCounter, 3786 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 4386 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:44,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 4386 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 19:25:44,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-07-12 19:25:44,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 657. [2022-07-12 19:25:44,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 545 states have (on average 1.363302752293578) internal successors, (743), 550 states have internal predecessors, (743), 80 states have call successors, (80), 26 states have call predecessors, (80), 31 states have return successors, (92), 80 states have call predecessors, (92), 75 states have call successors, (92) [2022-07-12 19:25:44,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 915 transitions. [2022-07-12 19:25:44,010 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 915 transitions. Word has length 43 [2022-07-12 19:25:44,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:44,011 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 915 transitions. [2022-07-12 19:25:44,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 915 transitions. [2022-07-12 19:25:44,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-12 19:25:44,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:44,012 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] [2022-07-12 19:25:44,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 19:25:44,013 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:44,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:44,013 INFO L85 PathProgramCache]: Analyzing trace with hash 724634571, now seen corresponding path program 1 times [2022-07-12 19:25:44,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:44,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340326925] [2022-07-12 19:25:44,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:44,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:44,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 19:25:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:44,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:44,122 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,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:44,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340326925] [2022-07-12 19:25:44,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340326925] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:44,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:44,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 19:25:44,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877718897] [2022-07-12 19:25:44,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:44,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 19:25:44,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:44,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 19:25:44,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:25:44,124 INFO L87 Difference]: Start difference. First operand 657 states and 915 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:44,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:44,850 INFO L93 Difference]: Finished difference Result 706 states and 990 transitions. [2022-07-12 19:25:44,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:25:44,850 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2022-07-12 19:25:44,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:44,852 INFO L225 Difference]: With dead ends: 706 [2022-07-12 19:25:44,852 INFO L226 Difference]: Without dead ends: 689 [2022-07-12 19:25:44,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-07-12 19:25:44,853 INFO L413 NwaCegarLoop]: 590 mSDtfsCounter, 244 mSDsluCounter, 4512 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 5102 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:44,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 5102 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 19:25:44,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2022-07-12 19:25:44,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 655. [2022-07-12 19:25:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 544 states have (on average 1.3621323529411764) internal successors, (741), 549 states have internal predecessors, (741), 79 states have call successors, (79), 26 states have call predecessors, (79), 31 states have return successors, (91), 79 states have call predecessors, (91), 74 states have call successors, (91) [2022-07-12 19:25:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 911 transitions. [2022-07-12 19:25:44,862 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 911 transitions. Word has length 47 [2022-07-12 19:25:44,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:44,862 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 911 transitions. [2022-07-12 19:25:44,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 911 transitions. [2022-07-12 19:25:44,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:25:44,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:44,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:44,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 19:25:44,863 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:44,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:44,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1637865694, now seen corresponding path program 1 times [2022-07-12 19:25:44,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:44,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225792025] [2022-07-12 19:25:44,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:44,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:44,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:25:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:44,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:45,001 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,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:45,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225792025] [2022-07-12 19:25:45,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225792025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:45,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:45,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 19:25:45,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346877032] [2022-07-12 19:25:45,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:45,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 19:25:45,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:45,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 19:25:45,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:25:45,005 INFO L87 Difference]: Start difference. First operand 655 states and 911 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:45,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:45,659 INFO L93 Difference]: Finished difference Result 704 states and 986 transitions. [2022-07-12 19:25:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:25:45,659 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-12 19:25:45,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:45,662 INFO L225 Difference]: With dead ends: 704 [2022-07-12 19:25:45,662 INFO L226 Difference]: Without dead ends: 686 [2022-07-12 19:25:45,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-07-12 19:25:45,663 INFO L413 NwaCegarLoop]: 574 mSDtfsCounter, 259 mSDsluCounter, 4050 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 4624 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:45,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 4624 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 19:25:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-07-12 19:25:45,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 654. [2022-07-12 19:25:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 543 states have (on average 1.3443830570902393) internal successors, (730), 548 states have internal predecessors, (730), 79 states have call successors, (79), 26 states have call predecessors, (79), 31 states have return successors, (91), 79 states have call predecessors, (91), 74 states have call successors, (91) [2022-07-12 19:25:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 900 transitions. [2022-07-12 19:25:45,680 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 900 transitions. Word has length 44 [2022-07-12 19:25:45,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:45,681 INFO L495 AbstractCegarLoop]: Abstraction has 654 states and 900 transitions. [2022-07-12 19:25:45,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 900 transitions. [2022-07-12 19:25:45,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:25:45,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:45,682 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:45,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 19:25:45,682 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:45,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:45,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1376070278, now seen corresponding path program 1 times [2022-07-12 19:25:45,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:45,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666465071] [2022-07-12 19:25:45,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:45,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:45,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 19:25:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:45,733 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,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:45,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666465071] [2022-07-12 19:25:45,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666465071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:45,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:45,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:25:45,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566933743] [2022-07-12 19:25:45,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:45,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:25:45,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:45,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:25:45,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:25:45,735 INFO L87 Difference]: Start difference. First operand 654 states and 900 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 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:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:46,081 INFO L93 Difference]: Finished difference Result 700 states and 969 transitions. [2022-07-12 19:25:46,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:25:46,081 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 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:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:46,083 INFO L225 Difference]: With dead ends: 700 [2022-07-12 19:25:46,083 INFO L226 Difference]: Without dead ends: 658 [2022-07-12 19:25:46,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:25:46,084 INFO L413 NwaCegarLoop]: 582 mSDtfsCounter, 235 mSDsluCounter, 3083 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 3665 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:46,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 3665 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:25:46,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-07-12 19:25:46,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 642. [2022-07-12 19:25:46,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 534 states have (on average 1.3389513108614233) internal successors, (715), 539 states have internal predecessors, (715), 76 states have call successors, (76), 26 states have call predecessors, (76), 31 states have return successors, (88), 76 states have call predecessors, (88), 71 states have call successors, (88) [2022-07-12 19:25:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 879 transitions. [2022-07-12 19:25:46,092 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 879 transitions. Word has length 44 [2022-07-12 19:25:46,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:46,092 INFO L495 AbstractCegarLoop]: Abstraction has 642 states and 879 transitions. [2022-07-12 19:25:46,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 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:46,092 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 879 transitions. [2022-07-12 19:25:46,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 19:25:46,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:46,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:46,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 19:25:46,095 INFO L420 AbstractCegarLoop]: === Iteration 27 === 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 -766417177, 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,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897272007] [2022-07-12 19:25:46,096 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,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:46,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:25:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:46,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 19:25:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:46,128 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,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:46,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897272007] [2022-07-12 19:25:46,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897272007] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:46,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:46,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:25:46,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125967356] [2022-07-12 19:25:46,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:46,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:25:46,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:46,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:25:46,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:25:46,140 INFO L87 Difference]: Start difference. First operand 642 states and 879 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:46,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:46,445 INFO L93 Difference]: Finished difference Result 693 states and 983 transitions. [2022-07-12 19:25:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:25:46,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-07-12 19:25:46,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:46,450 INFO L225 Difference]: With dead ends: 693 [2022-07-12 19:25:46,450 INFO L226 Difference]: Without dead ends: 693 [2022-07-12 19:25:46,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:25:46,451 INFO L413 NwaCegarLoop]: 535 mSDtfsCounter, 134 mSDsluCounter, 1653 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 2188 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:46,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 2188 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:25:46,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2022-07-12 19:25:46,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 649. [2022-07-12 19:25:46,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 539 states have (on average 1.339517625231911) internal successors, (722), 545 states have internal predecessors, (722), 77 states have call successors, (77), 26 states have call predecessors, (77), 32 states have return successors, (95), 77 states have call predecessors, (95), 72 states have call successors, (95) [2022-07-12 19:25:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 894 transitions. [2022-07-12 19:25:46,463 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 894 transitions. Word has length 45 [2022-07-12 19:25:46,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:46,464 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 894 transitions. [2022-07-12 19:25:46,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:46,464 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 894 transitions. [2022-07-12 19:25:46,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 19:25:46,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:46,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:46,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 19:25:46,466 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:46,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:46,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1275890267, now seen corresponding path program 1 times [2022-07-12 19:25:46,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:46,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606961888] [2022-07-12 19:25:46,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:46,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:46,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:25:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:46,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 19:25:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:46,521 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,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:46,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606961888] [2022-07-12 19:25:46,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606961888] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:46,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:46,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:25:46,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906782199] [2022-07-12 19:25:46,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:46,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:25:46,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:46,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:25:46,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:25:46,522 INFO L87 Difference]: Start difference. First operand 649 states and 894 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:46,870 INFO L93 Difference]: Finished difference Result 684 states and 959 transitions. [2022-07-12 19:25:46,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:25:46,871 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-07-12 19:25:46,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:46,874 INFO L225 Difference]: With dead ends: 684 [2022-07-12 19:25:46,874 INFO L226 Difference]: Without dead ends: 667 [2022-07-12 19:25:46,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:25:46,874 INFO L413 NwaCegarLoop]: 564 mSDtfsCounter, 245 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 3430 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:46,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 3430 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:25:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-07-12 19:25:46,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 647. [2022-07-12 19:25:46,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 538 states have (on average 1.338289962825279) internal successors, (720), 544 states have internal predecessors, (720), 76 states have call successors, (76), 26 states have call predecessors, (76), 32 states have return successors, (94), 76 states have call predecessors, (94), 71 states have call successors, (94) [2022-07-12 19:25:46,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 890 transitions. [2022-07-12 19:25:46,884 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 890 transitions. Word has length 45 [2022-07-12 19:25:46,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:46,884 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 890 transitions. [2022-07-12 19:25:46,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:46,884 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 890 transitions. [2022-07-12 19:25:46,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 19:25:46,885 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:46,885 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:46,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 19:25:46,885 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:46,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:46,886 INFO L85 PathProgramCache]: Analyzing trace with hash -499982008, now seen corresponding path program 1 times [2022-07-12 19:25:46,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:46,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464267594] [2022-07-12 19:25:46,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:46,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:46,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 19:25:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:46,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:46,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:46,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464267594] [2022-07-12 19:25:46,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464267594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:46,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:46,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:25:46,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971892578] [2022-07-12 19:25:46,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:46,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:25:46,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:46,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:25:46,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:25:46,923 INFO L87 Difference]: Start difference. First operand 647 states and 890 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 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,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:47,195 INFO L93 Difference]: Finished difference Result 691 states and 969 transitions. [2022-07-12 19:25:47,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:25:47,196 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 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 45 [2022-07-12 19:25:47,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:47,199 INFO L225 Difference]: With dead ends: 691 [2022-07-12 19:25:47,199 INFO L226 Difference]: Without dead ends: 659 [2022-07-12 19:25:47,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:25:47,200 INFO L413 NwaCegarLoop]: 550 mSDtfsCounter, 166 mSDsluCounter, 2963 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 3513 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:47,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 3513 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:47,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-07-12 19:25:47,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 639. [2022-07-12 19:25:47,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 532 states have (on average 1.330827067669173) internal successors, (708), 538 states have internal predecessors, (708), 74 states have call successors, (74), 26 states have call predecessors, (74), 32 states have return successors, (92), 74 states have call predecessors, (92), 69 states have call successors, (92) [2022-07-12 19:25:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 874 transitions. [2022-07-12 19:25:47,220 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 874 transitions. Word has length 45 [2022-07-12 19:25:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:47,225 INFO L495 AbstractCegarLoop]: Abstraction has 639 states and 874 transitions. [2022-07-12 19:25:47,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 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,225 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 874 transitions. [2022-07-12 19:25:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:25:47,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:47,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:47,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-12 19:25:47,228 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:47,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:47,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1469834137, now seen corresponding path program 1 times [2022-07-12 19:25:47,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:47,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545761968] [2022-07-12 19:25:47,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:47,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:47,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:25:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:47,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:47,368 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,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:47,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545761968] [2022-07-12 19:25:47,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545761968] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:47,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:47,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 19:25:47,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189551469] [2022-07-12 19:25:47,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:47,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:25:47,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:47,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:25:47,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:25:47,371 INFO L87 Difference]: Start difference. First operand 639 states and 874 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:47,981 INFO L93 Difference]: Finished difference Result 671 states and 936 transitions. [2022-07-12 19:25:47,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:25:47,981 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-07-12 19:25:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:47,984 INFO L225 Difference]: With dead ends: 671 [2022-07-12 19:25:47,984 INFO L226 Difference]: Without dead ends: 656 [2022-07-12 19:25:47,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:25:47,985 INFO L413 NwaCegarLoop]: 541 mSDtfsCounter, 110 mSDsluCounter, 3749 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 4290 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:47,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 4290 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 19:25:47,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-07-12 19:25:47,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 636. [2022-07-12 19:25:47,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 530 states have (on average 1.330188679245283) internal successors, (705), 536 states have internal predecessors, (705), 73 states have call successors, (73), 26 states have call predecessors, (73), 32 states have return successors, (91), 73 states have call predecessors, (91), 68 states have call successors, (91) [2022-07-12 19:25:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 869 transitions. [2022-07-12 19:25:47,995 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 869 transitions. Word has length 46 [2022-07-12 19:25:47,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:47,996 INFO L495 AbstractCegarLoop]: Abstraction has 636 states and 869 transitions. [2022-07-12 19:25:47,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:47,996 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 869 transitions. [2022-07-12 19:25:47,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:25:47,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:47,998 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] [2022-07-12 19:25:47,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-12 19:25:47,998 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:47,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:47,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1528127283, now seen corresponding path program 1 times [2022-07-12 19:25:47,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:47,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711155437] [2022-07-12 19:25:47,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:47,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:48,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:25:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:48,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 19:25:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:48,035 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,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:48,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711155437] [2022-07-12 19:25:48,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711155437] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:48,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:48,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:25:48,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203160294] [2022-07-12 19:25:48,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:48,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:25:48,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:48,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:25:48,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:25:48,037 INFO L87 Difference]: Start difference. First operand 636 states and 869 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:48,302 INFO L93 Difference]: Finished difference Result 668 states and 950 transitions. [2022-07-12 19:25:48,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:25:48,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-07-12 19:25:48,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:48,305 INFO L225 Difference]: With dead ends: 668 [2022-07-12 19:25:48,305 INFO L226 Difference]: Without dead ends: 666 [2022-07-12 19:25:48,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:25:48,306 INFO L413 NwaCegarLoop]: 529 mSDtfsCounter, 102 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:48,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 2632 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:48,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-07-12 19:25:48,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 640. [2022-07-12 19:25:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 532 states have (on average 1.3289473684210527) internal successors, (707), 540 states have internal predecessors, (707), 73 states have call successors, (73), 26 states have call predecessors, (73), 34 states have return successors, (107), 73 states have call predecessors, (107), 68 states have call successors, (107) [2022-07-12 19:25:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 887 transitions. [2022-07-12 19:25:48,316 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 887 transitions. Word has length 46 [2022-07-12 19:25:48,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:48,316 INFO L495 AbstractCegarLoop]: Abstraction has 640 states and 887 transitions. [2022-07-12 19:25:48,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 887 transitions. [2022-07-12 19:25:48,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-12 19:25:48,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:48,317 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:25:48,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-12 19:25:48,318 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:48,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:48,318 INFO L85 PathProgramCache]: Analyzing trace with hash -250939957, now seen corresponding path program 1 times [2022-07-12 19:25:48,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:48,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745546497] [2022-07-12 19:25:48,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:48,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:48,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 19:25:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:48,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:48,436 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,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:48,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745546497] [2022-07-12 19:25:48,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745546497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:48,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:48,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 19:25:48,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672745721] [2022-07-12 19:25:48,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:48,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:25:48,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:48,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:25:48,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:25:48,437 INFO L87 Difference]: Start difference. First operand 640 states and 887 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:49,075 INFO L93 Difference]: Finished difference Result 672 states and 949 transitions. [2022-07-12 19:25:49,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:25:49,076 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2022-07-12 19:25:49,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:49,078 INFO L225 Difference]: With dead ends: 672 [2022-07-12 19:25:49,078 INFO L226 Difference]: Without dead ends: 651 [2022-07-12 19:25:49,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:25:49,078 INFO L413 NwaCegarLoop]: 539 mSDtfsCounter, 123 mSDsluCounter, 4143 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 4682 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:49,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 4682 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 19:25:49,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-07-12 19:25:49,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 631. [2022-07-12 19:25:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 525 states have (on average 1.3295238095238096) internal successors, (698), 533 states have internal predecessors, (698), 71 states have call successors, (71), 26 states have call predecessors, (71), 34 states have return successors, (105), 71 states have call predecessors, (105), 66 states have call successors, (105) [2022-07-12 19:25:49,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 874 transitions. [2022-07-12 19:25:49,086 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 874 transitions. Word has length 54 [2022-07-12 19:25:49,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:49,087 INFO L495 AbstractCegarLoop]: Abstraction has 631 states and 874 transitions. [2022-07-12 19:25:49,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:49,087 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 874 transitions. [2022-07-12 19:25:49,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-12 19:25:49,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:49,088 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] [2022-07-12 19:25:49,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-12 19:25:49,088 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:49,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:49,088 INFO L85 PathProgramCache]: Analyzing trace with hash 43125576, now seen corresponding path program 1 times [2022-07-12 19:25:49,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:49,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053391613] [2022-07-12 19:25:49,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:49,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:49,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:25:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:49,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:49,212 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,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:49,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053391613] [2022-07-12 19:25:49,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053391613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:49,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:49,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 19:25:49,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71034045] [2022-07-12 19:25:49,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:49,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:25:49,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:49,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:25:49,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:25:49,214 INFO L87 Difference]: Start difference. First operand 631 states and 874 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:49,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:49,818 INFO L93 Difference]: Finished difference Result 663 states and 935 transitions. [2022-07-12 19:25:49,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:25:49,818 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-07-12 19:25:49,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:49,820 INFO L225 Difference]: With dead ends: 663 [2022-07-12 19:25:49,820 INFO L226 Difference]: Without dead ends: 648 [2022-07-12 19:25:49,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:25:49,821 INFO L413 NwaCegarLoop]: 523 mSDtfsCounter, 123 mSDsluCounter, 4027 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 4550 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:49,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 4550 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 19:25:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2022-07-12 19:25:49,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 628. [2022-07-12 19:25:49,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 523 states have (on average 1.3288718929254302) internal successors, (695), 531 states have internal predecessors, (695), 70 states have call successors, (70), 26 states have call predecessors, (70), 34 states have return successors, (104), 70 states have call predecessors, (104), 65 states have call successors, (104) [2022-07-12 19:25:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 869 transitions. [2022-07-12 19:25:49,830 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 869 transitions. Word has length 47 [2022-07-12 19:25:49,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:49,830 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 869 transitions. [2022-07-12 19:25:49,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:49,830 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 869 transitions. [2022-07-12 19:25:49,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 19:25:49,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:49,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] [2022-07-12 19:25:49,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-12 19:25:49,831 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:49,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:49,832 INFO L85 PathProgramCache]: Analyzing trace with hash 973189000, now seen corresponding path program 1 times [2022-07-12 19:25:49,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:49,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330070681] [2022-07-12 19:25:49,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:49,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:49,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 19:25:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:49,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:25:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:49,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 19:25:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:49,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:49,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:49,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330070681] [2022-07-12 19:25:49,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330070681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:49,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:49,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:25:49,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331555932] [2022-07-12 19:25:49,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:49,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:25:49,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:49,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:25:49,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:25:49,871 INFO L87 Difference]: Start difference. First operand 628 states and 869 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:25:50,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:50,157 INFO L93 Difference]: Finished difference Result 739 states and 1029 transitions. [2022-07-12 19:25:50,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:25:50,163 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), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-07-12 19:25:50,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:50,172 INFO L225 Difference]: With dead ends: 739 [2022-07-12 19:25:50,172 INFO L226 Difference]: Without dead ends: 739 [2022-07-12 19:25:50,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 3 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:50,173 INFO L413 NwaCegarLoop]: 576 mSDtfsCounter, 315 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:50,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1320 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:25:50,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-07-12 19:25:50,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 692. [2022-07-12 19:25:50,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 577 states have (on average 1.3275563258232235) internal successors, (766), 585 states have internal predecessors, (766), 73 states have call successors, (73), 30 states have call predecessors, (73), 41 states have return successors, (113), 76 states have call predecessors, (113), 69 states have call successors, (113) [2022-07-12 19:25:50,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 952 transitions. [2022-07-12 19:25:50,183 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 952 transitions. Word has length 50 [2022-07-12 19:25:50,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:50,183 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 952 transitions. [2022-07-12 19:25:50,183 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), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:25:50,183 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 952 transitions. [2022-07-12 19:25:50,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:25:50,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:50,184 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] [2022-07-12 19:25:50,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-12 19:25:50,185 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:50,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:50,185 INFO L85 PathProgramCache]: Analyzing trace with hash 721425391, now seen corresponding path program 1 times [2022-07-12 19:25:50,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:50,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951665741] [2022-07-12 19:25:50,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:50,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:25:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 19:25:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:50,291 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,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:50,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951665741] [2022-07-12 19:25:50,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951665741] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:50,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:50,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 19:25:50,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224357023] [2022-07-12 19:25:50,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:50,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 19:25:50,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:50,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 19:25:50,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:25:50,293 INFO L87 Difference]: Start difference. First operand 692 states and 952 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:25:50,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:50,966 INFO L93 Difference]: Finished difference Result 753 states and 1044 transitions. [2022-07-12 19:25:50,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 19:25:50,966 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-07-12 19:25:50,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:50,968 INFO L225 Difference]: With dead ends: 753 [2022-07-12 19:25:50,968 INFO L226 Difference]: Without dead ends: 736 [2022-07-12 19:25:50,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-12 19:25:50,969 INFO L413 NwaCegarLoop]: 510 mSDtfsCounter, 248 mSDsluCounter, 3683 mSDsCounter, 0 mSdLazyCounter, 1501 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 4193 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:50,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 4193 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1501 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 19:25:50,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2022-07-12 19:25:50,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 690. [2022-07-12 19:25:50,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 576 states have (on average 1.3263888888888888) internal successors, (764), 584 states have internal predecessors, (764), 72 states have call successors, (72), 30 states have call predecessors, (72), 41 states have return successors, (112), 75 states have call predecessors, (112), 68 states have call successors, (112) [2022-07-12 19:25:50,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 948 transitions. [2022-07-12 19:25:50,978 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 948 transitions. Word has length 51 [2022-07-12 19:25:50,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:50,978 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 948 transitions. [2022-07-12 19:25:50,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:25:50,978 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 948 transitions. [2022-07-12 19:25:50,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 19:25:50,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:50,979 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:50,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-12 19:25:50,980 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:50,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:50,980 INFO L85 PathProgramCache]: Analyzing trace with hash 618682838, now seen corresponding path program 1 times [2022-07-12 19:25:50,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:50,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774196645] [2022-07-12 19:25:50,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:50,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:51,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 19:25:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:51,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:51,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:51,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:51,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774196645] [2022-07-12 19:25:51,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774196645] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:51,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:51,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 19:25:51,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796099497] [2022-07-12 19:25:51,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:51,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 19:25:51,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:51,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 19:25:51,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:25:51,075 INFO L87 Difference]: Start difference. First operand 690 states and 948 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:51,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:51,741 INFO L93 Difference]: Finished difference Result 735 states and 1023 transitions. [2022-07-12 19:25:51,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:25:51,741 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-07-12 19:25:51,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:51,745 INFO L225 Difference]: With dead ends: 735 [2022-07-12 19:25:51,745 INFO L226 Difference]: Without dead ends: 718 [2022-07-12 19:25:51,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-07-12 19:25:51,746 INFO L413 NwaCegarLoop]: 494 mSDtfsCounter, 235 mSDsluCounter, 3716 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 4210 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:51,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 4210 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 19:25:51,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2022-07-12 19:25:51,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 688. [2022-07-12 19:25:51,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 575 states have (on average 1.325217391304348) internal successors, (762), 583 states have internal predecessors, (762), 71 states have call successors, (71), 30 states have call predecessors, (71), 41 states have return successors, (111), 74 states have call predecessors, (111), 67 states have call successors, (111) [2022-07-12 19:25:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 944 transitions. [2022-07-12 19:25:51,760 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 944 transitions. Word has length 48 [2022-07-12 19:25:51,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:51,760 INFO L495 AbstractCegarLoop]: Abstraction has 688 states and 944 transitions. [2022-07-12 19:25:51,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:51,761 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 944 transitions. [2022-07-12 19:25:51,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 19:25:51,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:51,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, 1, 1, 1, 1, 1] [2022-07-12 19:25:51,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-12 19:25:51,763 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:51,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:51,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1166693008, now seen corresponding path program 1 times [2022-07-12 19:25:51,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:51,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372662010] [2022-07-12 19:25:51,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:51,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:51,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:25:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:51,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 19:25:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:51,787 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,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:51,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372662010] [2022-07-12 19:25:51,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372662010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:51,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:51,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:25:51,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311469475] [2022-07-12 19:25:51,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:51,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:25:51,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:51,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:25:51,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:25:51,790 INFO L87 Difference]: Start difference. First operand 688 states and 944 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:51,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:51,983 INFO L93 Difference]: Finished difference Result 647 states and 868 transitions. [2022-07-12 19:25:51,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:25:51,983 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-07-12 19:25:51,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:51,985 INFO L225 Difference]: With dead ends: 647 [2022-07-12 19:25:51,985 INFO L226 Difference]: Without dead ends: 644 [2022-07-12 19:25:51,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:25:51,986 INFO L413 NwaCegarLoop]: 486 mSDtfsCounter, 97 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:51,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1554 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:51,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-07-12 19:25:51,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 615. [2022-07-12 19:25:51,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 518 states have (on average 1.3204633204633205) internal successors, (684), 524 states have internal predecessors, (684), 62 states have call successors, (62), 27 states have call predecessors, (62), 34 states have return successors, (75), 63 states have call predecessors, (75), 58 states have call successors, (75) [2022-07-12 19:25:51,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 821 transitions. [2022-07-12 19:25:52,011 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 821 transitions. Word has length 48 [2022-07-12 19:25:52,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:52,011 INFO L495 AbstractCegarLoop]: Abstraction has 615 states and 821 transitions. [2022-07-12 19:25:52,011 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 821 transitions. [2022-07-12 19:25:52,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 19:25:52,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:52,012 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:52,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-12 19:25:52,013 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:52,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:52,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1152872609, now seen corresponding path program 1 times [2022-07-12 19:25:52,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:52,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405833181] [2022-07-12 19:25:52,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:52,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:52,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 19:25:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:52,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:52,142 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,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:52,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405833181] [2022-07-12 19:25:52,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405833181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:52,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:52,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 19:25:52,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402498748] [2022-07-12 19:25:52,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:52,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:25:52,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:52,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:25:52,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:25:52,143 INFO L87 Difference]: Start difference. First operand 615 states and 821 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:52,681 INFO L93 Difference]: Finished difference Result 640 states and 853 transitions. [2022-07-12 19:25:52,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:25:52,682 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2022-07-12 19:25:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:52,683 INFO L225 Difference]: With dead ends: 640 [2022-07-12 19:25:52,683 INFO L226 Difference]: Without dead ends: 625 [2022-07-12 19:25:52,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:25:52,684 INFO L413 NwaCegarLoop]: 492 mSDtfsCounter, 116 mSDsluCounter, 3802 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 4294 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:52,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 4294 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 19:25:52,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-07-12 19:25:52,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 613. [2022-07-12 19:25:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 517 states have (on average 1.3191489361702127) internal successors, (682), 523 states have internal predecessors, (682), 61 states have call successors, (61), 27 states have call predecessors, (61), 34 states have return successors, (74), 62 states have call predecessors, (74), 57 states have call successors, (74) [2022-07-12 19:25:52,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 817 transitions. [2022-07-12 19:25:52,690 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 817 transitions. Word has length 57 [2022-07-12 19:25:52,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:52,690 INFO L495 AbstractCegarLoop]: Abstraction has 613 states and 817 transitions. [2022-07-12 19:25:52,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 817 transitions. [2022-07-12 19:25:52,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 19:25:52,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:52,691 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:52,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-12 19:25:52,691 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:52,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:52,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1985597816, now seen corresponding path program 1 times [2022-07-12 19:25:52,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:52,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377145113] [2022-07-12 19:25:52,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:52,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:52,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 19:25:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:52,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:52,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:52,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377145113] [2022-07-12 19:25:52,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377145113] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:52,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:52,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 19:25:52,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444074851] [2022-07-12 19:25:52,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:52,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:25:52,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:52,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:25:52,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:25:52,808 INFO L87 Difference]: Start difference. First operand 613 states and 817 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:53,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:53,385 INFO L93 Difference]: Finished difference Result 637 states and 848 transitions. [2022-07-12 19:25:53,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:25:53,387 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-07-12 19:25:53,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:53,388 INFO L225 Difference]: With dead ends: 637 [2022-07-12 19:25:53,388 INFO L226 Difference]: Without dead ends: 622 [2022-07-12 19:25:53,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:25:53,389 INFO L413 NwaCegarLoop]: 484 mSDtfsCounter, 116 mSDsluCounter, 3755 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 4239 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:53,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 4239 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 19:25:53,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2022-07-12 19:25:53,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 610. [2022-07-12 19:25:53,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 515 states have (on average 1.3184466019417476) internal successors, (679), 521 states have internal predecessors, (679), 60 states have call successors, (60), 27 states have call predecessors, (60), 34 states have return successors, (73), 61 states have call predecessors, (73), 56 states have call successors, (73) [2022-07-12 19:25:53,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 812 transitions. [2022-07-12 19:25:53,394 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 812 transitions. Word has length 48 [2022-07-12 19:25:53,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:53,394 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 812 transitions. [2022-07-12 19:25:53,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:53,395 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 812 transitions. [2022-07-12 19:25:53,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 19:25:53,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:53,396 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:53,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-12 19:25:53,396 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:53,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:53,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1806708367, now seen corresponding path program 1 times [2022-07-12 19:25:53,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:53,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920521886] [2022-07-12 19:25:53,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:53,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:53,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 19:25:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:53,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 19:25:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:53,429 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,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:53,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920521886] [2022-07-12 19:25:53,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920521886] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:53,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:53,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:25:53,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197377740] [2022-07-12 19:25:53,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:53,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:25:53,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:53,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:25:53,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:25:53,431 INFO L87 Difference]: Start difference. First operand 610 states and 812 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:53,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:53,669 INFO L93 Difference]: Finished difference Result 678 states and 897 transitions. [2022-07-12 19:25:53,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:25:53,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-07-12 19:25:53,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:53,671 INFO L225 Difference]: With dead ends: 678 [2022-07-12 19:25:53,671 INFO L226 Difference]: Without dead ends: 678 [2022-07-12 19:25:53,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:25:53,671 INFO L413 NwaCegarLoop]: 520 mSDtfsCounter, 334 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 2053 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:53,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 2053 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:53,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-07-12 19:25:53,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 616. [2022-07-12 19:25:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 520 states have (on average 1.3173076923076923) internal successors, (685), 526 states have internal predecessors, (685), 61 states have call successors, (61), 27 states have call predecessors, (61), 34 states have return successors, (74), 62 states have call predecessors, (74), 57 states have call successors, (74) [2022-07-12 19:25:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 820 transitions. [2022-07-12 19:25:53,678 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 820 transitions. Word has length 50 [2022-07-12 19:25:53,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:53,678 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 820 transitions. [2022-07-12 19:25:53,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:53,678 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 820 transitions. [2022-07-12 19:25:53,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 19:25:53,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:53,682 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] [2022-07-12 19:25:53,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-12 19:25:53,683 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:53,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:53,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1801199632, now seen corresponding path program 1 times [2022-07-12 19:25:53,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:53,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725436485] [2022-07-12 19:25:53,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:53,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:53,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:25:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:53,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:25:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:53,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:25:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:53,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 19:25:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:53,741 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,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:53,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725436485] [2022-07-12 19:25:53,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725436485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:53,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:53,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:25:53,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789961975] [2022-07-12 19:25:53,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:53,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:25:53,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:53,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:25:53,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:25:53,744 INFO L87 Difference]: Start difference. First operand 616 states and 820 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 4 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:54,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:54,032 INFO L93 Difference]: Finished difference Result 628 states and 837 transitions. [2022-07-12 19:25:54,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:25:54,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 4 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 53 [2022-07-12 19:25:54,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:54,034 INFO L225 Difference]: With dead ends: 628 [2022-07-12 19:25:54,034 INFO L226 Difference]: Without dead ends: 628 [2022-07-12 19:25:54,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:25:54,035 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 124 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:54,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1415 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:25:54,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2022-07-12 19:25:54,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 616. [2022-07-12 19:25:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 520 states have (on average 1.3134615384615385) internal successors, (683), 526 states have internal predecessors, (683), 61 states have call successors, (61), 27 states have call predecessors, (61), 34 states have return successors, (74), 62 states have call predecessors, (74), 57 states have call successors, (74) [2022-07-12 19:25:54,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 818 transitions. [2022-07-12 19:25:54,041 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 818 transitions. Word has length 53 [2022-07-12 19:25:54,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:54,041 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 818 transitions. [2022-07-12 19:25:54,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 4 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:54,041 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 818 transitions. [2022-07-12 19:25:54,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 19:25:54,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:54,043 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] [2022-07-12 19:25:54,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-12 19:25:54,044 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:54,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:54,044 INFO L85 PathProgramCache]: Analyzing trace with hash -261050894, now seen corresponding path program 1 times [2022-07-12 19:25:54,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:54,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912347662] [2022-07-12 19:25:54,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:54,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:54,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:25:54,089 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 23 [2022-07-12 19:25:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:54,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:54,131 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,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:54,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912347662] [2022-07-12 19:25:54,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912347662] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:54,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:54,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 19:25:54,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661748515] [2022-07-12 19:25:54,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:54,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 19:25:54,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:54,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 19:25:54,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:25:54,133 INFO L87 Difference]: Start difference. First operand 616 states and 818 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:25:54,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:54,725 INFO L93 Difference]: Finished difference Result 643 states and 852 transitions. [2022-07-12 19:25:54,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 19:25:54,726 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2022-07-12 19:25:54,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:54,727 INFO L225 Difference]: With dead ends: 643 [2022-07-12 19:25:54,727 INFO L226 Difference]: Without dead ends: 626 [2022-07-12 19:25:54,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-12 19:25:54,727 INFO L413 NwaCegarLoop]: 473 mSDtfsCounter, 325 mSDsluCounter, 3520 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 3993 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:54,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 3993 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 19:25:54,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2022-07-12 19:25:54,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 614. [2022-07-12 19:25:54,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 519 states have (on average 1.3121387283236994) internal successors, (681), 525 states have internal predecessors, (681), 60 states have call successors, (60), 27 states have call predecessors, (60), 34 states have return successors, (73), 61 states have call predecessors, (73), 56 states have call successors, (73) [2022-07-12 19:25:54,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 814 transitions. [2022-07-12 19:25:54,733 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 814 transitions. Word has length 52 [2022-07-12 19:25:54,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:54,733 INFO L495 AbstractCegarLoop]: Abstraction has 614 states and 814 transitions. [2022-07-12 19:25:54,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:25:54,734 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 814 transitions. [2022-07-12 19:25:54,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:25:54,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:54,735 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] [2022-07-12 19:25:54,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-12 19:25:54,735 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:54,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:54,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1698213256, now seen corresponding path program 1 times [2022-07-12 19:25:54,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:54,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651613621] [2022-07-12 19:25:54,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:54,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:54,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 19:25:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:54,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 19:25:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:54,783 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,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:54,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651613621] [2022-07-12 19:25:54,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651613621] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:54,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:54,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:25:54,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261046627] [2022-07-12 19:25:54,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:54,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:25:54,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:54,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:25:54,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:25:54,786 INFO L87 Difference]: Start difference. First operand 614 states and 814 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:55,110 INFO L93 Difference]: Finished difference Result 657 states and 870 transitions. [2022-07-12 19:25:55,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:25:55,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2022-07-12 19:25:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:55,111 INFO L225 Difference]: With dead ends: 657 [2022-07-12 19:25:55,111 INFO L226 Difference]: Without dead ends: 606 [2022-07-12 19:25:55,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:25:55,112 INFO L413 NwaCegarLoop]: 471 mSDtfsCounter, 262 mSDsluCounter, 2289 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 2760 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:55,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 2760 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:25:55,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-07-12 19:25:55,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 587. [2022-07-12 19:25:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 497 states have (on average 1.2977867203219315) internal successors, (645), 503 states have internal predecessors, (645), 55 states have call successors, (55), 27 states have call predecessors, (55), 34 states have return successors, (67), 56 states have call predecessors, (67), 51 states have call successors, (67) [2022-07-12 19:25:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 767 transitions. [2022-07-12 19:25:55,117 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 767 transitions. Word has length 51 [2022-07-12 19:25:55,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:55,117 INFO L495 AbstractCegarLoop]: Abstraction has 587 states and 767 transitions. [2022-07-12 19:25:55,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:55,117 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 767 transitions. [2022-07-12 19:25:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:25:55,118 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:55,118 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] [2022-07-12 19:25:55,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-12 19:25:55,119 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:55,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:55,119 INFO L85 PathProgramCache]: Analyzing trace with hash 673526006, now seen corresponding path program 1 times [2022-07-12 19:25:55,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:55,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441703002] [2022-07-12 19:25:55,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:55,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 19:25:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 19:25:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,153 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,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:55,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441703002] [2022-07-12 19:25:55,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441703002] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:55,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:55,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:25:55,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572300] [2022-07-12 19:25:55,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:55,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:25:55,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:55,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:25:55,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:25:55,154 INFO L87 Difference]: Start difference. First operand 587 states and 767 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:55,387 INFO L93 Difference]: Finished difference Result 593 states and 774 transitions. [2022-07-12 19:25:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:25:55,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2022-07-12 19:25:55,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:55,393 INFO L225 Difference]: With dead ends: 593 [2022-07-12 19:25:55,393 INFO L226 Difference]: Without dead ends: 593 [2022-07-12 19:25:55,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:25:55,393 INFO L413 NwaCegarLoop]: 415 mSDtfsCounter, 98 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:55,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1982 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:55,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-07-12 19:25:55,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 577. [2022-07-12 19:25:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 489 states have (on average 1.294478527607362) internal successors, (633), 495 states have internal predecessors, (633), 53 states have call successors, (53), 27 states have call predecessors, (53), 34 states have return successors, (65), 54 states have call predecessors, (65), 49 states have call successors, (65) [2022-07-12 19:25:55,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 751 transitions. [2022-07-12 19:25:55,398 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 751 transitions. Word has length 51 [2022-07-12 19:25:55,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:55,399 INFO L495 AbstractCegarLoop]: Abstraction has 577 states and 751 transitions. [2022-07-12 19:25:55,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:55,399 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 751 transitions. [2022-07-12 19:25:55,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 19:25:55,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:55,400 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] [2022-07-12 19:25:55,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-12 19:25:55,400 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:55,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:55,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1072773224, now seen corresponding path program 1 times [2022-07-12 19:25:55,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:55,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602565396] [2022-07-12 19:25:55,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:55,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 19:25:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 19:25:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,436 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,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:55,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602565396] [2022-07-12 19:25:55,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602565396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:55,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:55,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:25:55,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913303773] [2022-07-12 19:25:55,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:55,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:25:55,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:55,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:25:55,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:25:55,437 INFO L87 Difference]: Start difference. First operand 577 states and 751 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:55,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:55,637 INFO L93 Difference]: Finished difference Result 589 states and 768 transitions. [2022-07-12 19:25:55,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:25:55,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2022-07-12 19:25:55,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:55,638 INFO L225 Difference]: With dead ends: 589 [2022-07-12 19:25:55,638 INFO L226 Difference]: Without dead ends: 584 [2022-07-12 19:25:55,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:25:55,639 INFO L413 NwaCegarLoop]: 415 mSDtfsCounter, 171 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:55,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1738 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:55,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-07-12 19:25:55,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 572. [2022-07-12 19:25:55,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 485 states have (on average 1.2948453608247423) internal successors, (628), 491 states have internal predecessors, (628), 52 states have call successors, (52), 27 states have call predecessors, (52), 34 states have return successors, (64), 53 states have call predecessors, (64), 48 states have call successors, (64) [2022-07-12 19:25:55,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 744 transitions. [2022-07-12 19:25:55,645 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 744 transitions. Word has length 52 [2022-07-12 19:25:55,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:55,645 INFO L495 AbstractCegarLoop]: Abstraction has 572 states and 744 transitions. [2022-07-12 19:25:55,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 744 transitions. [2022-07-12 19:25:55,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 19:25:55,646 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:55,646 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] [2022-07-12 19:25:55,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-12 19:25:55,646 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:55,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:55,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1299527003, now seen corresponding path program 1 times [2022-07-12 19:25:55,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:55,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126847190] [2022-07-12 19:25:55,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:55,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 19:25:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,676 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,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:55,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126847190] [2022-07-12 19:25:55,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126847190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:55,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:55,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:25:55,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661700738] [2022-07-12 19:25:55,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:55,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:25:55,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:55,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:25:55,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:25:55,677 INFO L87 Difference]: Start difference. First operand 572 states and 744 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:55,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:55,953 INFO L93 Difference]: Finished difference Result 681 states and 887 transitions. [2022-07-12 19:25:55,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:25:55,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2022-07-12 19:25:55,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:55,955 INFO L225 Difference]: With dead ends: 681 [2022-07-12 19:25:55,955 INFO L226 Difference]: Without dead ends: 681 [2022-07-12 19:25:55,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:25:55,956 INFO L413 NwaCegarLoop]: 464 mSDtfsCounter, 217 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:55,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1318 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:25:55,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-07-12 19:25:55,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 600. [2022-07-12 19:25:55,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 511 states have (on average 1.289628180039139) internal successors, (659), 517 states have internal predecessors, (659), 52 states have call successors, (52), 27 states have call predecessors, (52), 36 states have return successors, (66), 55 states have call predecessors, (66), 48 states have call successors, (66) [2022-07-12 19:25:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 777 transitions. [2022-07-12 19:25:55,961 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 777 transitions. Word has length 52 [2022-07-12 19:25:55,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:55,961 INFO L495 AbstractCegarLoop]: Abstraction has 600 states and 777 transitions. [2022-07-12 19:25:55,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:55,962 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 777 transitions. [2022-07-12 19:25:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 19:25:55,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:55,962 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] [2022-07-12 19:25:55,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-07-12 19:25:55,963 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:55,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:55,963 INFO L85 PathProgramCache]: Analyzing trace with hash 2075413267, now seen corresponding path program 1 times [2022-07-12 19:25:55,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:55,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270517863] [2022-07-12 19:25:55,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:55,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 19:25:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:55,997 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,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:55,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270517863] [2022-07-12 19:25:55,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270517863] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:55,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:55,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:25:55,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189092697] [2022-07-12 19:25:55,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:55,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:25:55,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:55,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:25:55,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:25:55,999 INFO L87 Difference]: Start difference. First operand 600 states and 777 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:56,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:56,406 INFO L93 Difference]: Finished difference Result 679 states and 884 transitions. [2022-07-12 19:25:56,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:25:56,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-07-12 19:25:56,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:56,408 INFO L225 Difference]: With dead ends: 679 [2022-07-12 19:25:56,408 INFO L226 Difference]: Without dead ends: 679 [2022-07-12 19:25:56,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:25:56,408 INFO L413 NwaCegarLoop]: 461 mSDtfsCounter, 712 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:56,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 1524 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:25:56,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-07-12 19:25:56,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 600. [2022-07-12 19:25:56,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 511 states have (on average 1.2876712328767124) internal successors, (658), 517 states have internal predecessors, (658), 52 states have call successors, (52), 27 states have call predecessors, (52), 36 states have return successors, (66), 55 states have call predecessors, (66), 48 states have call successors, (66) [2022-07-12 19:25:56,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 776 transitions. [2022-07-12 19:25:56,415 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 776 transitions. Word has length 53 [2022-07-12 19:25:56,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:56,415 INFO L495 AbstractCegarLoop]: Abstraction has 600 states and 776 transitions. [2022-07-12 19:25:56,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:56,415 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 776 transitions. [2022-07-12 19:25:56,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 19:25:56,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:56,416 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] [2022-07-12 19:25:56,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-07-12 19:25:56,416 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:56,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:56,417 INFO L85 PathProgramCache]: Analyzing trace with hash 726957118, now seen corresponding path program 1 times [2022-07-12 19:25:56,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:56,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663533175] [2022-07-12 19:25:56,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:56,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:56,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:25:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:56,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 19:25:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:56,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 19:25:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:56,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:56,515 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,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:56,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663533175] [2022-07-12 19:25:56,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663533175] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:56,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:56,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 19:25:56,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43931629] [2022-07-12 19:25:56,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:56,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 19:25:56,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:56,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 19:25:56,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:25:56,516 INFO L87 Difference]: Start difference. First operand 600 states and 776 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 19:25:57,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:57,182 INFO L93 Difference]: Finished difference Result 652 states and 840 transitions. [2022-07-12 19:25:57,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 19:25:57,182 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 59 [2022-07-12 19:25:57,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:57,183 INFO L225 Difference]: With dead ends: 652 [2022-07-12 19:25:57,183 INFO L226 Difference]: Without dead ends: 635 [2022-07-12 19:25:57,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-12 19:25:57,186 INFO L413 NwaCegarLoop]: 431 mSDtfsCounter, 243 mSDsluCounter, 3596 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 4027 SdHoareTripleChecker+Invalid, 1704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:57,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 4027 Invalid, 1704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 19:25:57,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-07-12 19:25:57,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 598. [2022-07-12 19:25:57,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 510 states have (on average 1.2862745098039217) internal successors, (656), 516 states have internal predecessors, (656), 51 states have call successors, (51), 27 states have call predecessors, (51), 36 states have return successors, (65), 54 states have call predecessors, (65), 47 states have call successors, (65) [2022-07-12 19:25:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 772 transitions. [2022-07-12 19:25:57,196 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 772 transitions. Word has length 59 [2022-07-12 19:25:57,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:57,196 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 772 transitions. [2022-07-12 19:25:57,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 19:25:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 772 transitions. [2022-07-12 19:25:57,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 19:25:57,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:57,198 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] [2022-07-12 19:25:57,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-07-12 19:25:57,198 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:57,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:57,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2135115312, now seen corresponding path program 1 times [2022-07-12 19:25:57,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:57,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549374686] [2022-07-12 19:25:57,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:57,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:57,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 19:25:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:57,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 19:25:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:57,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:57,344 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:57,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:57,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549374686] [2022-07-12 19:25:57,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549374686] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:57,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:57,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-12 19:25:57,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217112177] [2022-07-12 19:25:57,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:57,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 19:25:57,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:57,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 19:25:57,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:25:57,345 INFO L87 Difference]: Start difference. First operand 598 states and 772 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:25:58,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:58,023 INFO L93 Difference]: Finished difference Result 627 states and 808 transitions. [2022-07-12 19:25:58,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 19:25:58,023 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55 [2022-07-12 19:25:58,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:58,025 INFO L225 Difference]: With dead ends: 627 [2022-07-12 19:25:58,025 INFO L226 Difference]: Without dead ends: 606 [2022-07-12 19:25:58,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2022-07-12 19:25:58,026 INFO L413 NwaCegarLoop]: 408 mSDtfsCounter, 235 mSDsluCounter, 3444 mSDsCounter, 0 mSdLazyCounter, 1612 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 3852 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:58,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 3852 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1612 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 19:25:58,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-07-12 19:25:58,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 594. [2022-07-12 19:25:58,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 507 states have (on average 1.2859960552268244) internal successors, (652), 513 states have internal predecessors, (652), 50 states have call successors, (50), 27 states have call predecessors, (50), 36 states have return successors, (64), 53 states have call predecessors, (64), 46 states have call successors, (64) [2022-07-12 19:25:58,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 766 transitions. [2022-07-12 19:25:58,033 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 766 transitions. Word has length 55 [2022-07-12 19:25:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:58,034 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 766 transitions. [2022-07-12 19:25:58,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:25:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 766 transitions. [2022-07-12 19:25:58,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-12 19:25:58,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:58,035 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:58,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-07-12 19:25:58,035 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:58,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:58,036 INFO L85 PathProgramCache]: Analyzing trace with hash 538585810, now seen corresponding path program 1 times [2022-07-12 19:25:58,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:58,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650053621] [2022-07-12 19:25:58,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:58,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:58,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 19:25:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:58,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 19:25:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:58,082 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,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:58,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650053621] [2022-07-12 19:25:58,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650053621] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:58,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:58,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:25:58,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343413860] [2022-07-12 19:25:58,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:58,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:25:58,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:58,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:25:58,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:25:58,084 INFO L87 Difference]: Start difference. First operand 594 states and 766 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:58,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:58,291 INFO L93 Difference]: Finished difference Result 606 states and 783 transitions. [2022-07-12 19:25:58,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:25:58,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-07-12 19:25:58,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:58,293 INFO L225 Difference]: With dead ends: 606 [2022-07-12 19:25:58,293 INFO L226 Difference]: Without dead ends: 601 [2022-07-12 19:25:58,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:25:58,293 INFO L413 NwaCegarLoop]: 398 mSDtfsCounter, 171 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:58,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1662 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:25:58,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-07-12 19:25:58,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 589. [2022-07-12 19:25:58,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 503 states have (on average 1.286282306163022) internal successors, (647), 509 states have internal predecessors, (647), 49 states have call successors, (49), 27 states have call predecessors, (49), 36 states have return successors, (63), 52 states have call predecessors, (63), 45 states have call successors, (63) [2022-07-12 19:25:58,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 759 transitions. [2022-07-12 19:25:58,298 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 759 transitions. Word has length 54 [2022-07-12 19:25:58,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:58,298 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 759 transitions. [2022-07-12 19:25:58,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 759 transitions. [2022-07-12 19:25:58,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-12 19:25:58,299 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:58,299 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:58,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-07-12 19:25:58,300 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:58,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:58,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1724995102, now seen corresponding path program 1 times [2022-07-12 19:25:58,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:58,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918231603] [2022-07-12 19:25:58,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:58,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:58,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 19:25:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:58,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 19:25:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:58,366 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,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:58,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918231603] [2022-07-12 19:25:58,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918231603] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:58,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:58,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 19:25:58,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889088874] [2022-07-12 19:25:58,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:58,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:25:58,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:58,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:25:58,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:25:58,367 INFO L87 Difference]: Start difference. First operand 589 states and 759 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:58,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:58,706 INFO L93 Difference]: Finished difference Result 621 states and 799 transitions. [2022-07-12 19:25:58,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:25:58,706 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-07-12 19:25:58,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:58,707 INFO L225 Difference]: With dead ends: 621 [2022-07-12 19:25:58,708 INFO L226 Difference]: Without dead ends: 598 [2022-07-12 19:25:58,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:25:58,708 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 232 mSDsluCounter, 2644 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 3051 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:58,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 3051 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:25:58,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-07-12 19:25:58,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 586. [2022-07-12 19:25:58,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 501 states have (on average 1.2854291417165669) internal successors, (644), 507 states have internal predecessors, (644), 48 states have call successors, (48), 27 states have call predecessors, (48), 36 states have return successors, (62), 51 states have call predecessors, (62), 44 states have call successors, (62) [2022-07-12 19:25:58,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 754 transitions. [2022-07-12 19:25:58,713 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 754 transitions. Word has length 54 [2022-07-12 19:25:58,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:58,713 INFO L495 AbstractCegarLoop]: Abstraction has 586 states and 754 transitions. [2022-07-12 19:25:58,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:58,713 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 754 transitions. [2022-07-12 19:25:58,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-12 19:25:58,714 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:58,714 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:58,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-07-12 19:25:58,714 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:58,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:58,715 INFO L85 PathProgramCache]: Analyzing trace with hash -726384384, now seen corresponding path program 1 times [2022-07-12 19:25:58,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:58,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884720138] [2022-07-12 19:25:58,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:58,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:58,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 19:25:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:58,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:58,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:58,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884720138] [2022-07-12 19:25:58,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884720138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:58,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:58,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:25:58,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799997199] [2022-07-12 19:25:58,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:58,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:25:58,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:58,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:25:58,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:25:58,782 INFO L87 Difference]: Start difference. First operand 586 states and 754 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:59,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:59,164 INFO L93 Difference]: Finished difference Result 665 states and 860 transitions. [2022-07-12 19:25:59,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:25:59,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-07-12 19:25:59,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:59,166 INFO L225 Difference]: With dead ends: 665 [2022-07-12 19:25:59,166 INFO L226 Difference]: Without dead ends: 665 [2022-07-12 19:25:59,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:25:59,166 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 688 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:59,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 1442 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:25:59,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-07-12 19:25:59,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 584. [2022-07-12 19:25:59,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 499 states have (on average 1.2845691382765532) internal successors, (641), 505 states have internal predecessors, (641), 48 states have call successors, (48), 27 states have call predecessors, (48), 36 states have return successors, (62), 51 states have call predecessors, (62), 44 states have call successors, (62) [2022-07-12 19:25:59,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 751 transitions. [2022-07-12 19:25:59,171 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 751 transitions. Word has length 54 [2022-07-12 19:25:59,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:59,172 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 751 transitions. [2022-07-12 19:25:59,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:25:59,172 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 751 transitions. [2022-07-12 19:25:59,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-12 19:25:59,173 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:59,173 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:59,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-07-12 19:25:59,173 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:59,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:59,174 INFO L85 PathProgramCache]: Analyzing trace with hash -726107554, now seen corresponding path program 1 times [2022-07-12 19:25:59,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:59,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334323726] [2022-07-12 19:25:59,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:59,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 19:25:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:25:59,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:59,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334323726] [2022-07-12 19:25:59,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334323726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:59,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:59,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 19:25:59,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974477833] [2022-07-12 19:25:59,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:59,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:25:59,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:59,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:25:59,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:25:59,264 INFO L87 Difference]: Start difference. First operand 584 states and 751 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:59,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:25:59,763 INFO L93 Difference]: Finished difference Result 603 states and 775 transitions. [2022-07-12 19:25:59,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:25:59,763 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2022-07-12 19:25:59,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:25:59,764 INFO L225 Difference]: With dead ends: 603 [2022-07-12 19:25:59,764 INFO L226 Difference]: Without dead ends: 558 [2022-07-12 19:25:59,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:25:59,765 INFO L413 NwaCegarLoop]: 375 mSDtfsCounter, 279 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 2499 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:25:59,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 2499 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:25:59,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-07-12 19:25:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 542. [2022-07-12 19:25:59,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 459 states have (on average 1.2745098039215685) internal successors, (585), 465 states have internal predecessors, (585), 48 states have call successors, (48), 27 states have call predecessors, (48), 34 states have return successors, (60), 49 states have call predecessors, (60), 44 states have call successors, (60) [2022-07-12 19:25:59,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 693 transitions. [2022-07-12 19:25:59,770 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 693 transitions. Word has length 54 [2022-07-12 19:25:59,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:25:59,770 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 693 transitions. [2022-07-12 19:25:59,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:25:59,770 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 693 transitions. [2022-07-12 19:25:59,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 19:25:59,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:25:59,771 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] [2022-07-12 19:25:59,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-07-12 19:25:59,771 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:25:59,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:25:59,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1795419470, now seen corresponding path program 1 times [2022-07-12 19:25:59,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:25:59,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900217466] [2022-07-12 19:25:59,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:25:59,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:25:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 19:25:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:25:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:25:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:25:59,830 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:59,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:25:59,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900217466] [2022-07-12 19:25:59,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900217466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:25:59,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:25:59,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:25:59,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075312270] [2022-07-12 19:25:59,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:25:59,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:25:59,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:25:59,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:25:59,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:25:59,831 INFO L87 Difference]: Start difference. First operand 542 states and 693 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:26:00,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:00,166 INFO L93 Difference]: Finished difference Result 572 states and 730 transitions. [2022-07-12 19:26:00,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:26:00,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2022-07-12 19:26:00,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:00,167 INFO L225 Difference]: With dead ends: 572 [2022-07-12 19:26:00,168 INFO L226 Difference]: Without dead ends: 572 [2022-07-12 19:26:00,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:26:00,168 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 178 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:00,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1748 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:26:00,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-07-12 19:26:00,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 542. [2022-07-12 19:26:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 459 states have (on average 1.2723311546840959) internal successors, (584), 465 states have internal predecessors, (584), 48 states have call successors, (48), 27 states have call predecessors, (48), 34 states have return successors, (60), 49 states have call predecessors, (60), 44 states have call successors, (60) [2022-07-12 19:26:00,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 692 transitions. [2022-07-12 19:26:00,174 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 692 transitions. Word has length 56 [2022-07-12 19:26:00,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:00,174 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 692 transitions. [2022-07-12 19:26:00,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:26:00,174 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 692 transitions. [2022-07-12 19:26:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 19:26:00,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:00,175 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] [2022-07-12 19:26:00,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-07-12 19:26:00,175 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:00,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:00,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1818051724, now seen corresponding path program 1 times [2022-07-12 19:26:00,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:00,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165384605] [2022-07-12 19:26:00,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:00,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 19:26:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:26:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:26:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:00,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:00,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165384605] [2022-07-12 19:26:00,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165384605] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:00,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:00,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 19:26:00,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325770357] [2022-07-12 19:26:00,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:00,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 19:26:00,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:00,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 19:26:00,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:26:00,275 INFO L87 Difference]: Start difference. First operand 542 states and 692 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:26:00,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:00,857 INFO L93 Difference]: Finished difference Result 594 states and 756 transitions. [2022-07-12 19:26:00,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 19:26:00,857 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2022-07-12 19:26:00,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:00,859 INFO L225 Difference]: With dead ends: 594 [2022-07-12 19:26:00,859 INFO L226 Difference]: Without dead ends: 567 [2022-07-12 19:26:00,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-12 19:26:00,859 INFO L413 NwaCegarLoop]: 403 mSDtfsCounter, 266 mSDsluCounter, 2795 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 3198 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:00,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 3198 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 19:26:00,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-07-12 19:26:00,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 537. [2022-07-12 19:26:00,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 455 states have (on average 1.268131868131868) internal successors, (577), 461 states have internal predecessors, (577), 47 states have call successors, (47), 27 states have call predecessors, (47), 34 states have return successors, (58), 48 states have call predecessors, (58), 43 states have call successors, (58) [2022-07-12 19:26:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 682 transitions. [2022-07-12 19:26:00,864 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 682 transitions. Word has length 56 [2022-07-12 19:26:00,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:00,864 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 682 transitions. [2022-07-12 19:26:00,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:26:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 682 transitions. [2022-07-12 19:26:00,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 19:26:00,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:00,865 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] [2022-07-12 19:26:00,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-07-12 19:26:00,865 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:00,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:00,866 INFO L85 PathProgramCache]: Analyzing trace with hash -356987344, now seen corresponding path program 1 times [2022-07-12 19:26:00,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:00,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130018903] [2022-07-12 19:26:00,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:00,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 19:26:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:26:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:26:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:00,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:00,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130018903] [2022-07-12 19:26:00,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130018903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:00,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:00,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:26:00,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699132208] [2022-07-12 19:26:00,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:00,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:26:00,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:00,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:26:00,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:26:00,909 INFO L87 Difference]: Start difference. First operand 537 states and 682 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:26:01,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:01,252 INFO L93 Difference]: Finished difference Result 549 states and 699 transitions. [2022-07-12 19:26:01,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:26:01,253 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2022-07-12 19:26:01,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:01,254 INFO L225 Difference]: With dead ends: 549 [2022-07-12 19:26:01,254 INFO L226 Difference]: Without dead ends: 543 [2022-07-12 19:26:01,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:26:01,254 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 159 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:01,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1829 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:26:01,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-07-12 19:26:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 531. [2022-07-12 19:26:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 450 states have (on average 1.268888888888889) internal successors, (571), 456 states have internal predecessors, (571), 46 states have call successors, (46), 27 states have call predecessors, (46), 34 states have return successors, (57), 47 states have call predecessors, (57), 42 states have call successors, (57) [2022-07-12 19:26:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 674 transitions. [2022-07-12 19:26:01,260 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 674 transitions. Word has length 56 [2022-07-12 19:26:01,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:01,260 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 674 transitions. [2022-07-12 19:26:01,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:26:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 674 transitions. [2022-07-12 19:26:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 19:26:01,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:01,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-07-12 19:26:01,262 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:01,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:01,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2107046685, now seen corresponding path program 1 times [2022-07-12 19:26:01,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:01,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103193565] [2022-07-12 19:26:01,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:01,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:01,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:26:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:01,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 19:26:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:01,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 19:26:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:01,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:26:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:01,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:01,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103193565] [2022-07-12 19:26:01,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103193565] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:01,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:01,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 19:26:01,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343514588] [2022-07-12 19:26:01,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:01,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 19:26:01,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:01,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 19:26:01,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:26:01,360 INFO L87 Difference]: Start difference. First operand 531 states and 674 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 19:26:01,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:01,959 INFO L93 Difference]: Finished difference Result 560 states and 710 transitions. [2022-07-12 19:26:01,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 19:26:01,960 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 62 [2022-07-12 19:26:01,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:01,960 INFO L225 Difference]: With dead ends: 560 [2022-07-12 19:26:01,961 INFO L226 Difference]: Without dead ends: 541 [2022-07-12 19:26:01,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-12 19:26:01,961 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 304 mSDsluCounter, 2574 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 2950 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:01,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 2950 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1384 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 19:26:01,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-07-12 19:26:01,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 529. [2022-07-12 19:26:01,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 448 states have (on average 1.2678571428571428) internal successors, (568), 454 states have internal predecessors, (568), 46 states have call successors, (46), 27 states have call predecessors, (46), 34 states have return successors, (57), 47 states have call predecessors, (57), 42 states have call successors, (57) [2022-07-12 19:26:01,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 671 transitions. [2022-07-12 19:26:01,966 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 671 transitions. Word has length 62 [2022-07-12 19:26:01,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:01,966 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 671 transitions. [2022-07-12 19:26:01,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 19:26:01,966 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 671 transitions. [2022-07-12 19:26:01,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 19:26:01,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:01,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-07-12 19:26:01,967 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:01,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:01,968 INFO L85 PathProgramCache]: Analyzing trace with hash -790506152, now seen corresponding path program 1 times [2022-07-12 19:26:01,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:01,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546908125] [2022-07-12 19:26:01,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:01,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:01,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:26:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:01,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 19:26:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:02,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 19:26:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:02,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:26:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:02,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:02,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:02,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546908125] [2022-07-12 19:26:02,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546908125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:02,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:02,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:26:02,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100217349] [2022-07-12 19:26:02,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:02,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:26:02,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:02,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:26:02,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:26:02,017 INFO L87 Difference]: Start difference. First operand 529 states and 671 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:26:02,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:02,311 INFO L93 Difference]: Finished difference Result 533 states and 675 transitions. [2022-07-12 19:26:02,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:26:02,312 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 63 [2022-07-12 19:26:02,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:02,312 INFO L225 Difference]: With dead ends: 533 [2022-07-12 19:26:02,313 INFO L226 Difference]: Without dead ends: 525 [2022-07-12 19:26:02,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:26:02,313 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 159 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:02,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1693 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:26:02,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-07-12 19:26:02,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 513. [2022-07-12 19:26:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 435 states have (on average 1.264367816091954) internal successors, (550), 441 states have internal predecessors, (550), 43 states have call successors, (43), 27 states have call predecessors, (43), 34 states have return successors, (53), 44 states have call predecessors, (53), 39 states have call successors, (53) [2022-07-12 19:26:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 646 transitions. [2022-07-12 19:26:02,317 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 646 transitions. Word has length 63 [2022-07-12 19:26:02,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:02,317 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 646 transitions. [2022-07-12 19:26:02,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:26:02,317 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 646 transitions. [2022-07-12 19:26:02,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 19:26:02,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:02,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-07-12 19:26:02,319 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:02,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:02,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1208974705, now seen corresponding path program 1 times [2022-07-12 19:26:02,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:02,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475664947] [2022-07-12 19:26:02,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:02,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:02,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 19:26:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:02,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 19:26:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:02,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:26:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:02,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:02,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475664947] [2022-07-12 19:26:02,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475664947] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:02,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:02,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:26:02,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725409846] [2022-07-12 19:26:02,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:02,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:26:02,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:02,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:26:02,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:26:02,360 INFO L87 Difference]: Start difference. First operand 513 states and 646 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:26:02,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:02,611 INFO L93 Difference]: Finished difference Result 524 states and 660 transitions. [2022-07-12 19:26:02,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:26:02,612 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2022-07-12 19:26:02,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:02,612 INFO L225 Difference]: With dead ends: 524 [2022-07-12 19:26:02,612 INFO L226 Difference]: Without dead ends: 512 [2022-07-12 19:26:02,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:26:02,613 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 176 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:02,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1452 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:26:02,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-07-12 19:26:02,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 500. [2022-07-12 19:26:02,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 423 states have (on average 1.260047281323877) internal successors, (533), 429 states have internal predecessors, (533), 42 states have call successors, (42), 27 states have call predecessors, (42), 34 states have return successors, (52), 43 states have call predecessors, (52), 38 states have call successors, (52) [2022-07-12 19:26:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 627 transitions. [2022-07-12 19:26:02,617 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 627 transitions. Word has length 58 [2022-07-12 19:26:02,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:02,617 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 627 transitions. [2022-07-12 19:26:02,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:26:02,617 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 627 transitions. [2022-07-12 19:26:02,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 19:26:02,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:02,618 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] [2022-07-12 19:26:02,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-07-12 19:26:02,618 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:02,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:02,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1375988349, now seen corresponding path program 1 times [2022-07-12 19:26:02,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:02,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391902624] [2022-07-12 19:26:02,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:02,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:02,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 19:26:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:02,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:26:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:02,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:26:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:02,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:02,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:02,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391902624] [2022-07-12 19:26:02,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391902624] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:02,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:02,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 19:26:02,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998488669] [2022-07-12 19:26:02,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:02,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:26:02,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:02,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:26:02,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:26:02,762 INFO L87 Difference]: Start difference. First operand 500 states and 627 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:26:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:03,767 INFO L93 Difference]: Finished difference Result 932 states and 1172 transitions. [2022-07-12 19:26:03,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-12 19:26:03,767 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2022-07-12 19:26:03,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:03,769 INFO L225 Difference]: With dead ends: 932 [2022-07-12 19:26:03,769 INFO L226 Difference]: Without dead ends: 903 [2022-07-12 19:26:03,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=1153, Unknown=0, NotChecked=0, Total=1406 [2022-07-12 19:26:03,770 INFO L413 NwaCegarLoop]: 375 mSDtfsCounter, 691 mSDsluCounter, 1935 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 2310 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:03,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 2310 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 19:26:03,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2022-07-12 19:26:03,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 694. [2022-07-12 19:26:03,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 583 states have (on average 1.2727272727272727) internal successors, (742), 595 states have internal predecessors, (742), 59 states have call successors, (59), 40 states have call predecessors, (59), 51 states have return successors, (77), 58 states have call predecessors, (77), 55 states have call successors, (77) [2022-07-12 19:26:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 878 transitions. [2022-07-12 19:26:03,776 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 878 transitions. Word has length 58 [2022-07-12 19:26:03,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:03,776 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 878 transitions. [2022-07-12 19:26:03,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:26:03,776 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 878 transitions. [2022-07-12 19:26:03,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 19:26:03,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:03,777 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] [2022-07-12 19:26:03,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-07-12 19:26:03,777 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:03,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:03,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2042959941, now seen corresponding path program 1 times [2022-07-12 19:26:03,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:03,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892103720] [2022-07-12 19:26:03,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:03,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:03,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 19:26:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:03,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:26:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:03,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:26:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:03,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:03,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892103720] [2022-07-12 19:26:03,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892103720] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:03,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:03,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:26:03,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212976286] [2022-07-12 19:26:03,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:03,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:26:03,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:03,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:26:03,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:26:03,816 INFO L87 Difference]: Start difference. First operand 694 states and 878 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:26:04,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:04,255 INFO L93 Difference]: Finished difference Result 920 states and 1159 transitions. [2022-07-12 19:26:04,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:26:04,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2022-07-12 19:26:04,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:04,258 INFO L225 Difference]: With dead ends: 920 [2022-07-12 19:26:04,258 INFO L226 Difference]: Without dead ends: 920 [2022-07-12 19:26:04,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:26:04,258 INFO L413 NwaCegarLoop]: 601 mSDtfsCounter, 1048 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:04,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 1669 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:26:04,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2022-07-12 19:26:04,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 513. [2022-07-12 19:26:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 435 states have (on average 1.2551724137931035) internal successors, (546), 440 states have internal predecessors, (546), 42 states have call successors, (42), 29 states have call predecessors, (42), 35 states have return successors, (52), 43 states have call predecessors, (52), 38 states have call successors, (52) [2022-07-12 19:26:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 640 transitions. [2022-07-12 19:26:04,266 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 640 transitions. Word has length 58 [2022-07-12 19:26:04,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:04,266 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 640 transitions. [2022-07-12 19:26:04,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:26:04,266 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 640 transitions. [2022-07-12 19:26:04,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-12 19:26:04,267 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:04,267 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] [2022-07-12 19:26:04,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-07-12 19:26:04,268 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:04,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:04,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1970957845, now seen corresponding path program 1 times [2022-07-12 19:26:04,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:04,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013218958] [2022-07-12 19:26:04,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:04,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:04,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:26:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:04,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 19:26:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:04,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 19:26:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:04,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:26:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:04,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:04,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013218958] [2022-07-12 19:26:04,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013218958] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:04,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:04,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 19:26:04,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630972663] [2022-07-12 19:26:04,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:04,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 19:26:04,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:04,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 19:26:04,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:26:04,406 INFO L87 Difference]: Start difference. First operand 513 states and 640 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 19:26:04,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:04,976 INFO L93 Difference]: Finished difference Result 539 states and 671 transitions. [2022-07-12 19:26:04,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 19:26:04,976 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2022-07-12 19:26:04,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:04,977 INFO L225 Difference]: With dead ends: 539 [2022-07-12 19:26:04,977 INFO L226 Difference]: Without dead ends: 504 [2022-07-12 19:26:04,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-12 19:26:04,978 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 218 mSDsluCounter, 2347 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 2683 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:04,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 2683 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 19:26:04,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-07-12 19:26:04,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 492. [2022-07-12 19:26:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 419 states have (on average 1.2553699284009547) internal successors, (526), 424 states have internal predecessors, (526), 38 states have call successors, (38), 28 states have call predecessors, (38), 34 states have return successors, (47), 39 states have call predecessors, (47), 34 states have call successors, (47) [2022-07-12 19:26:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 611 transitions. [2022-07-12 19:26:04,982 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 611 transitions. Word has length 60 [2022-07-12 19:26:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:04,982 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 611 transitions. [2022-07-12 19:26:04,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 19:26:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 611 transitions. [2022-07-12 19:26:04,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 19:26:04,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:04,983 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] [2022-07-12 19:26:04,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-07-12 19:26:04,983 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:04,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:04,983 INFO L85 PathProgramCache]: Analyzing trace with hash 789888525, now seen corresponding path program 1 times [2022-07-12 19:26:04,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:04,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909363281] [2022-07-12 19:26:04,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:04,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:05,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 19:26:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:05,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 19:26:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:05,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:05,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909363281] [2022-07-12 19:26:05,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909363281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:05,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:05,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:26:05,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518884229] [2022-07-12 19:26:05,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:05,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:26:05,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:05,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:26:05,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:26:05,016 INFO L87 Difference]: Start difference. First operand 492 states and 611 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:26:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:05,166 INFO L93 Difference]: Finished difference Result 502 states and 623 transitions. [2022-07-12 19:26:05,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:26:05,167 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2022-07-12 19:26:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:05,173 INFO L225 Difference]: With dead ends: 502 [2022-07-12 19:26:05,173 INFO L226 Difference]: Without dead ends: 496 [2022-07-12 19:26:05,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:26:05,174 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 148 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:05,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1228 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:26:05,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-07-12 19:26:05,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 484. [2022-07-12 19:26:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 412 states have (on average 1.2548543689320388) internal successors, (517), 417 states have internal predecessors, (517), 37 states have call successors, (37), 28 states have call predecessors, (37), 34 states have return successors, (45), 38 states have call predecessors, (45), 33 states have call successors, (45) [2022-07-12 19:26:05,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 599 transitions. [2022-07-12 19:26:05,178 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 599 transitions. Word has length 58 [2022-07-12 19:26:05,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:05,178 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 599 transitions. [2022-07-12 19:26:05,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:26:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 599 transitions. [2022-07-12 19:26:05,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-12 19:26:05,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:05,181 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 19:26:05,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-07-12 19:26:05,181 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:05,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:05,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2051318318, now seen corresponding path program 1 times [2022-07-12 19:26:05,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:05,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806275474] [2022-07-12 19:26:05,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:05,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:05,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 19:26:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:05,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:26:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:05,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 19:26:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:05,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:26:05,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:05,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806275474] [2022-07-12 19:26:05,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806275474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:05,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:05,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:26:05,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45084368] [2022-07-12 19:26:05,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:05,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:26:05,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:05,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:26:05,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:26:05,221 INFO L87 Difference]: Start difference. First operand 484 states and 599 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:26:05,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:05,389 INFO L93 Difference]: Finished difference Result 496 states and 614 transitions. [2022-07-12 19:26:05,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:26:05,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2022-07-12 19:26:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:05,393 INFO L225 Difference]: With dead ends: 496 [2022-07-12 19:26:05,393 INFO L226 Difference]: Without dead ends: 486 [2022-07-12 19:26:05,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:26:05,394 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 148 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:05,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1193 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:26:05,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-07-12 19:26:05,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 474. [2022-07-12 19:26:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 404 states have (on average 1.254950495049505) internal successors, (507), 409 states have internal predecessors, (507), 35 states have call successors, (35), 28 states have call predecessors, (35), 34 states have return successors, (43), 36 states have call predecessors, (43), 31 states have call successors, (43) [2022-07-12 19:26:05,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 585 transitions. [2022-07-12 19:26:05,401 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 585 transitions. Word has length 60 [2022-07-12 19:26:05,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:05,401 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 585 transitions. [2022-07-12 19:26:05,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:26:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 585 transitions. [2022-07-12 19:26:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-12 19:26:05,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:05,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-07-12 19:26:05,402 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:05,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:05,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1819248512, now seen corresponding path program 1 times [2022-07-12 19:26:05,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:05,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390126914] [2022-07-12 19:26:05,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:05,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:05,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 19:26:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:05,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:26:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:05,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 19:26:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:05,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:05,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390126914] [2022-07-12 19:26:05,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390126914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:05,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:05,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 19:26:05,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077135932] [2022-07-12 19:26:05,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:05,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:26:05,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:05,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:26:05,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:26:05,500 INFO L87 Difference]: Start difference. First operand 474 states and 585 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:26:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:06,221 INFO L93 Difference]: Finished difference Result 765 states and 956 transitions. [2022-07-12 19:26:06,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 19:26:06,221 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2022-07-12 19:26:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:06,222 INFO L225 Difference]: With dead ends: 765 [2022-07-12 19:26:06,222 INFO L226 Difference]: Without dead ends: 732 [2022-07-12 19:26:06,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2022-07-12 19:26:06,223 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 607 mSDsluCounter, 2393 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 2881 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:06,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 2881 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 19:26:06,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2022-07-12 19:26:06,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 368. [2022-07-12 19:26:06,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 310 states have (on average 1.270967741935484) internal successors, (394), 314 states have internal predecessors, (394), 30 states have call successors, (30), 24 states have call predecessors, (30), 27 states have return successors, (36), 29 states have call predecessors, (36), 27 states have call successors, (36) [2022-07-12 19:26:06,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 460 transitions. [2022-07-12 19:26:06,227 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 460 transitions. Word has length 60 [2022-07-12 19:26:06,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:06,227 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 460 transitions. [2022-07-12 19:26:06,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:26:06,228 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 460 transitions. [2022-07-12 19:26:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-12 19:26:06,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:06,228 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] [2022-07-12 19:26:06,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-07-12 19:26:06,229 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:06,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:06,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1463057072, now seen corresponding path program 1 times [2022-07-12 19:26:06,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:06,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10542557] [2022-07-12 19:26:06,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:06,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:06,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:26:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:06,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:06,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:06,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 19:26:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:06,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 19:26:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:06,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:06,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:06,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10542557] [2022-07-12 19:26:06,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10542557] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:06,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:06,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 19:26:06,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730599063] [2022-07-12 19:26:06,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:06,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:26:06,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:06,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:26:06,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:26:06,331 INFO L87 Difference]: Start difference. First operand 368 states and 460 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 19:26:06,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:06,596 INFO L93 Difference]: Finished difference Result 373 states and 465 transitions. [2022-07-12 19:26:06,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:26:06,596 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2022-07-12 19:26:06,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:06,597 INFO L225 Difference]: With dead ends: 373 [2022-07-12 19:26:06,597 INFO L226 Difference]: Without dead ends: 373 [2022-07-12 19:26:06,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:26:06,597 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 113 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:06,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1209 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:26:06,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-07-12 19:26:06,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 361. [2022-07-12 19:26:06,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 303 states have (on average 1.2640264026402641) internal successors, (383), 307 states have internal predecessors, (383), 30 states have call successors, (30), 24 states have call predecessors, (30), 27 states have return successors, (36), 29 states have call predecessors, (36), 27 states have call successors, (36) [2022-07-12 19:26:06,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 449 transitions. [2022-07-12 19:26:06,600 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 449 transitions. Word has length 64 [2022-07-12 19:26:06,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:06,600 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 449 transitions. [2022-07-12 19:26:06,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 19:26:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 449 transitions. [2022-07-12 19:26:06,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 19:26:06,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:06,601 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 19:26:06,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-07-12 19:26:06,601 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:06,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:06,601 INFO L85 PathProgramCache]: Analyzing trace with hash 659665596, now seen corresponding path program 1 times [2022-07-12 19:26:06,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:06,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016052703] [2022-07-12 19:26:06,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:06,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:06,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 19:26:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:06,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 19:26:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:06,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 19:26:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:06,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:26:06,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:06,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016052703] [2022-07-12 19:26:06,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016052703] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:26:06,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481257298] [2022-07-12 19:26:06,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:06,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:26:06,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:26:06,652 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:26:06,653 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:26:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:06,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:26:06,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:06,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:06,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481257298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:06,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:26:06,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-12 19:26:06,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645644196] [2022-07-12 19:26:06,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:06,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:26:06,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:06,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:26:06,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:26:06,860 INFO L87 Difference]: Start difference. First operand 361 states and 449 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:26:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:06,880 INFO L93 Difference]: Finished difference Result 346 states and 431 transitions. [2022-07-12 19:26:06,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:26:06,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2022-07-12 19:26:06,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:06,881 INFO L225 Difference]: With dead ends: 346 [2022-07-12 19:26:06,881 INFO L226 Difference]: Without dead ends: 332 [2022-07-12 19:26:06,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:26:06,882 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:06,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 917 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:26:06,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-07-12 19:26:06,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2022-07-12 19:26:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 280 states have (on average 1.275) internal successors, (357), 283 states have internal predecessors, (357), 27 states have call successors, (27), 22 states have call predecessors, (27), 24 states have return successors, (32), 26 states have call predecessors, (32), 24 states have call successors, (32) [2022-07-12 19:26:06,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 416 transitions. [2022-07-12 19:26:06,885 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 416 transitions. Word has length 62 [2022-07-12 19:26:06,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:06,885 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 416 transitions. [2022-07-12 19:26:06,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:26:06,885 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 416 transitions. [2022-07-12 19:26:06,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-12 19:26:06,885 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:06,885 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] [2022-07-12 19:26:06,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 19:26:07,086 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,SelfDestructingSolverStorable66 [2022-07-12 19:26:07,086 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:07,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:07,087 INFO L85 PathProgramCache]: Analyzing trace with hash -747836141, now seen corresponding path program 1 times [2022-07-12 19:26:07,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:07,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255162551] [2022-07-12 19:26:07,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:07,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:07,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 19:26:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:07,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 19:26:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:07,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 19:26:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:07,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:07,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:07,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255162551] [2022-07-12 19:26:07,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255162551] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:07,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:07,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 19:26:07,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491099337] [2022-07-12 19:26:07,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:07,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 19:26:07,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:07,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 19:26:07,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:26:07,210 INFO L87 Difference]: Start difference. First operand 332 states and 416 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:26:07,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:07,682 INFO L93 Difference]: Finished difference Result 343 states and 430 transitions. [2022-07-12 19:26:07,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:26:07,682 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2022-07-12 19:26:07,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:07,683 INFO L225 Difference]: With dead ends: 343 [2022-07-12 19:26:07,683 INFO L226 Difference]: Without dead ends: 270 [2022-07-12 19:26:07,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-07-12 19:26:07,684 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 154 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:07,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1699 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:26:07,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-07-12 19:26:07,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 264. [2022-07-12 19:26:07,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 220 states have (on average 1.3) internal successors, (286), 222 states have internal predecessors, (286), 22 states have call successors, (22), 19 states have call predecessors, (22), 21 states have return successors, (28), 22 states have call predecessors, (28), 20 states have call successors, (28) [2022-07-12 19:26:07,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 336 transitions. [2022-07-12 19:26:07,686 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 336 transitions. Word has length 64 [2022-07-12 19:26:07,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:07,686 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 336 transitions. [2022-07-12 19:26:07,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:26:07,686 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 336 transitions. [2022-07-12 19:26:07,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-12 19:26:07,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:07,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-07-12 19:26:07,687 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:07,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:07,687 INFO L85 PathProgramCache]: Analyzing trace with hash 611039127, now seen corresponding path program 1 times [2022-07-12 19:26:07,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:07,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743530817] [2022-07-12 19:26:07,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:07,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:07,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:26:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:07,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:07,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:07,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 19:26:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:07,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 19:26:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:07,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 19:26:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:07,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:07,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743530817] [2022-07-12 19:26:07,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743530817] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:07,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:07,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 19:26:07,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362570656] [2022-07-12 19:26:07,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:07,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:26:07,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:07,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:26:07,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:26:07,807 INFO L87 Difference]: Start difference. First operand 264 states and 336 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 6 states have internal predecessors, (54), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 19:26:08,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:08,047 INFO L93 Difference]: Finished difference Result 270 states and 342 transitions. [2022-07-12 19:26:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:26:08,048 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 6 states have internal predecessors, (54), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 68 [2022-07-12 19:26:08,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:08,048 INFO L225 Difference]: With dead ends: 270 [2022-07-12 19:26:08,048 INFO L226 Difference]: Without dead ends: 270 [2022-07-12 19:26:08,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-07-12 19:26:08,049 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 192 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:08,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 799 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:26:08,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-07-12 19:26:08,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 264. [2022-07-12 19:26:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 220 states have (on average 1.2954545454545454) internal successors, (285), 222 states have internal predecessors, (285), 22 states have call successors, (22), 19 states have call predecessors, (22), 21 states have return successors, (28), 22 states have call predecessors, (28), 20 states have call successors, (28) [2022-07-12 19:26:08,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 335 transitions. [2022-07-12 19:26:08,051 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 335 transitions. Word has length 68 [2022-07-12 19:26:08,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:08,051 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 335 transitions. [2022-07-12 19:26:08,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 6 states have internal predecessors, (54), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 19:26:08,051 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 335 transitions. [2022-07-12 19:26:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-12 19:26:08,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:08,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-07-12 19:26:08,052 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:08,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:08,052 INFO L85 PathProgramCache]: Analyzing trace with hash -993138030, now seen corresponding path program 1 times [2022-07-12 19:26:08,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:08,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705385865] [2022-07-12 19:26:08,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:08,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:26:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 19:26:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 19:26:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 19:26:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,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:26:08,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:08,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705385865] [2022-07-12 19:26:08,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705385865] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:08,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:08,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:26:08,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980441522] [2022-07-12 19:26:08,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:08,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:26:08,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:08,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:26:08,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:26:08,118 INFO L87 Difference]: Start difference. First operand 264 states and 335 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, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 19:26:08,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:08,286 INFO L93 Difference]: Finished difference Result 216 states and 264 transitions. [2022-07-12 19:26:08,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:26:08,286 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, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 70 [2022-07-12 19:26:08,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:08,287 INFO L225 Difference]: With dead ends: 216 [2022-07-12 19:26:08,287 INFO L226 Difference]: Without dead ends: 216 [2022-07-12 19:26:08,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:26:08,287 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 97 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:08,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 660 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:26:08,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-12 19:26:08,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 175. [2022-07-12 19:26:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 146 states have internal predecessors, (179), 15 states have call successors, (15), 13 states have call predecessors, (15), 14 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17) [2022-07-12 19:26:08,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 211 transitions. [2022-07-12 19:26:08,290 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 211 transitions. Word has length 70 [2022-07-12 19:26:08,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:08,290 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 211 transitions. [2022-07-12 19:26:08,290 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, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 19:26:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 211 transitions. [2022-07-12 19:26:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-12 19:26:08,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:08,291 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:26:08,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-07-12 19:26:08,291 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:08,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:08,291 INFO L85 PathProgramCache]: Analyzing trace with hash -365687255, now seen corresponding path program 1 times [2022-07-12 19:26:08,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:08,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566574411] [2022-07-12 19:26:08,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:08,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:26:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 19:26:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 19:26:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 19:26:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 19:26:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:08,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:08,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566574411] [2022-07-12 19:26:08,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566574411] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:08,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:08,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 19:26:08,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527406964] [2022-07-12 19:26:08,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:08,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:26:08,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:08,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:26:08,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:26:08,370 INFO L87 Difference]: Start difference. First operand 175 states and 211 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 19:26:08,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:08,596 INFO L93 Difference]: Finished difference Result 221 states and 263 transitions. [2022-07-12 19:26:08,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:26:08,597 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 84 [2022-07-12 19:26:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:08,597 INFO L225 Difference]: With dead ends: 221 [2022-07-12 19:26:08,597 INFO L226 Difference]: Without dead ends: 185 [2022-07-12 19:26:08,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:26:08,598 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 198 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:08,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 899 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:26:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-12 19:26:08,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 173. [2022-07-12 19:26:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 143 states have (on average 1.2027972027972027) internal successors, (172), 144 states have internal predecessors, (172), 15 states have call successors, (15), 13 states have call predecessors, (15), 14 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17) [2022-07-12 19:26:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 204 transitions. [2022-07-12 19:26:08,599 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 204 transitions. Word has length 84 [2022-07-12 19:26:08,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:08,600 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 204 transitions. [2022-07-12 19:26:08,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 19:26:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 204 transitions. [2022-07-12 19:26:08,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-12 19:26:08,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:08,600 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] [2022-07-12 19:26:08,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-07-12 19:26:08,600 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:08,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:08,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1430253116, now seen corresponding path program 1 times [2022-07-12 19:26:08,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:08,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746578959] [2022-07-12 19:26:08,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:08,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 19:26:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 19:26:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 19:26:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 19:26:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 19:26:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:08,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:08,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746578959] [2022-07-12 19:26:08,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746578959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:08,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:08,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 19:26:08,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468480955] [2022-07-12 19:26:08,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:08,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:26:08,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:08,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:26:08,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:26:08,693 INFO L87 Difference]: Start difference. First operand 173 states and 204 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 19:26:08,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:08,893 INFO L93 Difference]: Finished difference Result 198 states and 231 transitions. [2022-07-12 19:26:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:26:08,894 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), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2022-07-12 19:26:08,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:08,894 INFO L225 Difference]: With dead ends: 198 [2022-07-12 19:26:08,894 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 19:26:08,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-07-12 19:26:08,895 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 88 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:08,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 863 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:26:08,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 19:26:08,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 141. [2022-07-12 19:26:08,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 116 states have (on average 1.1637931034482758) internal successors, (135), 117 states have internal predecessors, (135), 12 states have call successors, (12), 11 states have call predecessors, (12), 12 states have return successors, (13), 12 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-12 19:26:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2022-07-12 19:26:08,896 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 86 [2022-07-12 19:26:08,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:08,897 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2022-07-12 19:26:08,897 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), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 19:26:08,897 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2022-07-12 19:26:08,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-12 19:26:08,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:08,897 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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:08,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-07-12 19:26:08,897 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:08,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:08,898 INFO L85 PathProgramCache]: Analyzing trace with hash -336818959, now seen corresponding path program 1 times [2022-07-12 19:26:08,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:08,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400453447] [2022-07-12 19:26:08,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:08,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 19:26:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 19:26:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 19:26:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 19:26:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 19:26:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 19:26:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 19:26:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:08,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 19:26:08,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:08,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400453447] [2022-07-12 19:26:08,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400453447] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:26:08,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984220926] [2022-07-12 19:26:08,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:08,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:26:08,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:26:08,975 INFO L229 MonitoredProcess]: Starting monitored process 3 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:26:08,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 19:26:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:26:09,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 19:26:09,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:09,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984220926] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:09,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:26:09,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-12 19:26:09,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602513955] [2022-07-12 19:26:09,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:09,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:09,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:09,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:09,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:26:09,133 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 19:26:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:09,138 INFO L93 Difference]: Finished difference Result 170 states and 195 transitions. [2022-07-12 19:26:09,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:09,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 103 [2022-07-12 19:26:09,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:09,139 INFO L225 Difference]: With dead ends: 170 [2022-07-12 19:26:09,139 INFO L226 Difference]: Without dead ends: 170 [2022-07-12 19:26:09,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:26:09,139 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 16 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:09,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 236 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:26:09,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-12 19:26:09,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 151. [2022-07-12 19:26:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.152) internal successors, (144), 125 states have internal predecessors, (144), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (15), 14 states have call predecessors, (15), 12 states have call successors, (15) [2022-07-12 19:26:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 172 transitions. [2022-07-12 19:26:09,141 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 172 transitions. Word has length 103 [2022-07-12 19:26:09,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:09,141 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 172 transitions. [2022-07-12 19:26:09,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 19:26:09,141 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 172 transitions. [2022-07-12 19:26:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-12 19:26:09,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:09,142 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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:09,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 19:26:09,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2022-07-12 19:26:09,355 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:09,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:09,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1586409075, now seen corresponding path program 1 times [2022-07-12 19:26:09,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:09,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608458894] [2022-07-12 19:26:09,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:09,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 19:26:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 19:26:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 19:26:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 19:26:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 19:26:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 19:26:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 19:26:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,414 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 19:26:09,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:09,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608458894] [2022-07-12 19:26:09,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608458894] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:26:09,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391815130] [2022-07-12 19:26:09,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:09,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:26:09,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:26:09,416 INFO L229 MonitoredProcess]: Starting monitored process 4 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:26:09,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 19:26:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:26:09,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:26:09,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:09,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391815130] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:09,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:26:09,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-07-12 19:26:09,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648816802] [2022-07-12 19:26:09,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:09,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:26:09,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:09,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:26:09,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:26:09,602 INFO L87 Difference]: Start difference. First operand 151 states and 172 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 19:26:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:09,664 INFO L93 Difference]: Finished difference Result 151 states and 170 transitions. [2022-07-12 19:26:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:26:09,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 103 [2022-07-12 19:26:09,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:09,664 INFO L225 Difference]: With dead ends: 151 [2022-07-12 19:26:09,664 INFO L226 Difference]: Without dead ends: 151 [2022-07-12 19:26:09,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:26:09,665 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 144 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:09,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 214 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:26:09,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-12 19:26:09,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-07-12 19:26:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.136) internal successors, (142), 125 states have internal predecessors, (142), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (15), 14 states have call predecessors, (15), 12 states have call successors, (15) [2022-07-12 19:26:09,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 170 transitions. [2022-07-12 19:26:09,667 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 170 transitions. Word has length 103 [2022-07-12 19:26:09,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:09,667 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 170 transitions. [2022-07-12 19:26:09,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 19:26:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 170 transitions. [2022-07-12 19:26:09,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-12 19:26:09,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:09,668 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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:09,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 19:26:09,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:26:09,873 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:09,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:09,874 INFO L85 PathProgramCache]: Analyzing trace with hash 631465488, now seen corresponding path program 1 times [2022-07-12 19:26:09,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:09,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842356767] [2022-07-12 19:26:09,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:09,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 19:26:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:26:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 19:26:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 19:26:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 19:26:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 19:26:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 19:26:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:09,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:26:09,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:09,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842356767] [2022-07-12 19:26:09,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842356767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:09,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:09,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 19:26:09,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002735848] [2022-07-12 19:26:09,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:09,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:26:09,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:09,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:26:09,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:26:09,973 INFO L87 Difference]: Start difference. First operand 151 states and 170 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 19:26:10,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:10,217 INFO L93 Difference]: Finished difference Result 259 states and 285 transitions. [2022-07-12 19:26:10,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 19:26:10,218 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 104 [2022-07-12 19:26:10,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:10,218 INFO L225 Difference]: With dead ends: 259 [2022-07-12 19:26:10,218 INFO L226 Difference]: Without dead ends: 151 [2022-07-12 19:26:10,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-07-12 19:26:10,219 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 205 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:10,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 644 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:26:10,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-12 19:26:10,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-07-12 19:26:10,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.128) internal successors, (141), 125 states have internal predecessors, (141), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (15), 14 states have call predecessors, (15), 12 states have call successors, (15) [2022-07-12 19:26:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 169 transitions. [2022-07-12 19:26:10,221 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 169 transitions. Word has length 104 [2022-07-12 19:26:10,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:10,221 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 169 transitions. [2022-07-12 19:26:10,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 19:26:10,221 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 169 transitions. [2022-07-12 19:26:10,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-12 19:26:10,222 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:10,222 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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:10,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-07-12 19:26:10,222 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:10,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:10,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1542761419, now seen corresponding path program 1 times [2022-07-12 19:26:10,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:10,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292026966] [2022-07-12 19:26:10,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:10,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:10,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 19:26:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:10,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:26:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:10,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:10,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:10,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 19:26:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:10,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 19:26:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:10,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 19:26:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:10,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 19:26:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:10,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 19:26:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:26:10,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:10,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292026966] [2022-07-12 19:26:10,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292026966] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:10,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:10,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:26:10,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054145345] [2022-07-12 19:26:10,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:10,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:26:10,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:10,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:26:10,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:26:10,287 INFO L87 Difference]: Start difference. First operand 151 states and 169 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 19:26:10,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:10,417 INFO L93 Difference]: Finished difference Result 170 states and 188 transitions. [2022-07-12 19:26:10,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:26:10,417 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 104 [2022-07-12 19:26:10,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:10,418 INFO L225 Difference]: With dead ends: 170 [2022-07-12 19:26:10,418 INFO L226 Difference]: Without dead ends: 170 [2022-07-12 19:26:10,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:26:10,418 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 92 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:10,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 487 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:26:10,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-12 19:26:10,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 151. [2022-07-12 19:26:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.096) internal successors, (137), 125 states have internal predecessors, (137), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (15), 14 states have call predecessors, (15), 12 states have call successors, (15) [2022-07-12 19:26:10,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2022-07-12 19:26:10,421 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 104 [2022-07-12 19:26:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:10,421 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2022-07-12 19:26:10,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 19:26:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2022-07-12 19:26:10,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-12 19:26:10,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:10,422 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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:10,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-07-12 19:26:10,422 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:10,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:10,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1766005042, now seen corresponding path program 1 times [2022-07-12 19:26:10,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:10,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40724628] [2022-07-12 19:26:10,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:10,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:10,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 19:26:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:10,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:26:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:10,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:10,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 19:26:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:10,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 19:26:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:10,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 19:26:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:10,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 19:26:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:10,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 19:26:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:10,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 19:26:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:10,520 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:26:10,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:10,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40724628] [2022-07-12 19:26:10,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40724628] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:10,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:10,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 19:26:10,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240047722] [2022-07-12 19:26:10,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:10,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 19:26:10,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:10,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 19:26:10,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:26:10,522 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 19:26:10,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:10,757 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2022-07-12 19:26:10,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:26:10,758 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 104 [2022-07-12 19:26:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:10,758 INFO L225 Difference]: With dead ends: 148 [2022-07-12 19:26:10,758 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 19:26:10,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2022-07-12 19:26:10,758 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 189 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:10,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 633 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:26:10,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 19:26:10,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 19:26:10,759 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:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 19:26:10,759 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2022-07-12 19:26:10,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:10,759 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 19:26:10,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 19:26:10,760 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 19:26:10,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 19:26:10,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-07-12 19:26:10,762 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-07-12 19:26:10,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-07-12 19:26:10,764 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, 1, 1, 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:10,765 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 19:26:10,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 07:26:10 BoogieIcfgContainer [2022-07-12 19:26:10,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 19:26:10,767 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 19:26:10,767 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 19:26:10,767 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 19:26:10,767 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:37" (3/4) ... [2022-07-12 19:26:10,769 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 19:26:10,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure SendSrbSynchronous [2022-07-12 19:26:10,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2022-07-12 19:26:10,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSignalCompletion [2022-07-12 19:26:10,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure AG_SetStatusAndReturn [2022-07-12 19:26:10,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2022-07-12 19:26:10,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2022-07-12 19:26:10,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2022-07-12 19:26:10,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSendToNextDriver [2022-07-12 19:26:10,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioIsPlayActive [2022-07-12 19:26:10,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2022-07-12 19:26:10,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2022-07-12 19:26:10,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioForwardIrpSynchronous [2022-07-12 19:26:10,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HPCdrCompletion [2022-07-12 19:26:10,794 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 60 nodes and edges [2022-07-12 19:26:10,795 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2022-07-12 19:26:10,797 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-12 19:26:10,798 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 19:26:10,900 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 19:26:10,900 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 19:26:10,900 INFO L158 Benchmark]: Toolchain (without parser) took 34715.34ms. Allocated memory was 125.8MB in the beginning and 283.1MB in the end (delta: 157.3MB). Free memory was 95.2MB in the beginning and 91.3MB in the end (delta: 3.9MB). Peak memory consumption was 160.6MB. Max. memory is 16.1GB. [2022-07-12 19:26:10,902 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 90.2MB. Free memory was 46.3MB in the beginning and 46.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:26:10,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.79ms. Allocated memory is still 125.8MB. Free memory was 94.8MB in the beginning and 85.5MB in the end (delta: 9.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 19:26:10,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.24ms. Allocated memory is still 125.8MB. Free memory was 85.5MB in the beginning and 78.4MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 19:26:10,905 INFO L158 Benchmark]: Boogie Preprocessor took 68.72ms. Allocated memory is still 125.8MB. Free memory was 78.4MB in the beginning and 73.5MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 19:26:10,907 INFO L158 Benchmark]: RCFGBuilder took 926.48ms. Allocated memory is still 125.8MB. Free memory was 73.5MB in the beginning and 54.7MB in the end (delta: 18.8MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2022-07-12 19:26:10,907 INFO L158 Benchmark]: TraceAbstraction took 33095.46ms. Allocated memory was 125.8MB in the beginning and 283.1MB in the end (delta: 157.3MB). Free memory was 54.0MB in the beginning and 116.4MB in the end (delta: -62.4MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. [2022-07-12 19:26:10,907 INFO L158 Benchmark]: Witness Printer took 133.64ms. Allocated memory is still 283.1MB. Free memory was 116.4MB in the beginning and 91.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-07-12 19:26:10,908 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 90.2MB. Free memory was 46.3MB in the beginning and 46.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.79ms. Allocated memory is still 125.8MB. Free memory was 94.8MB in the beginning and 85.5MB in the end (delta: 9.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.24ms. Allocated memory is still 125.8MB. Free memory was 85.5MB in the beginning and 78.4MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.72ms. Allocated memory is still 125.8MB. Free memory was 78.4MB in the beginning and 73.5MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 926.48ms. Allocated memory is still 125.8MB. Free memory was 73.5MB in the beginning and 54.7MB in the end (delta: 18.8MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. * TraceAbstraction took 33095.46ms. Allocated memory was 125.8MB in the beginning and 283.1MB in the end (delta: 157.3MB). Free memory was 54.0MB in the beginning and 116.4MB in the end (delta: -62.4MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. * Witness Printer took 133.64ms. Allocated memory is still 283.1MB. Free memory was 116.4MB in the beginning and 91.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. 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: 59]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1717]: 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 14 procedures, 469 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 33.0s, OverallIterations: 77, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 25.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22686 SdHoareTripleChecker+Valid, 21.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22219 mSDsluCounter, 166312 SdHoareTripleChecker+Invalid, 17.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 129161 mSDsCounter, 5921 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45034 IncrementalHoareTripleChecker+Invalid, 50955 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5921 mSolverCounterUnsat, 37151 mSDtfsCounter, 45034 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1473 GetRequests, 685 SyntacticMatches, 4 SemanticMatches, 784 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1065occurred in iteration=10, InterpolantAutomatonStates: 685, 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, 77 MinimizatonAttempts, 3219 StatesRemovedByMinimization, 69 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 4160 NumberOfCodeBlocks, 4160 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 4080 ConstructedInterpolants, 0 QuantifiedInterpolants, 10477 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1664 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 80 InterpolantComputations, 77 PerfectInterpolantSequences, 71/85 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:10,933 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