./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product26.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec8_product26.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5be9e48e11f5f92f9ccb04262780ea6fa0bae40b757b81b8e52fca7547f54831 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:57:17,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:57:17,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:57:17,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:57:17,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:57:17,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:57:17,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:57:17,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:57:17,122 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:57:17,122 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:57:17,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:57:17,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:57:17,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:57:17,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:57:17,123 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:57:17,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:57:17,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:57:17,123 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:57:17,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:57:17,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:57:17,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:57:17,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:57:17,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:57:17,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:57:17,123 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:57:17,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:57:17,123 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:57:17,124 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:57:17,124 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:57:17,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:57:17,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:57:17,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:57:17,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:57:17,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:57:17,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:57:17,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:57:17,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:57:17,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:57:17,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:57:17,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:57:17,124 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:57:17,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:57:17,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:57:17,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:57:17,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:57:17,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:57:17,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:57:17,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:57:17,125 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 ! call(reach_error())) ) 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 -> 5be9e48e11f5f92f9ccb04262780ea6fa0bae40b757b81b8e52fca7547f54831 [2025-01-09 03:57:17,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:57:17,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:57:17,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:57:17,328 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:57:17,328 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:57:17,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product26.cil.c [2025-01-09 03:57:18,415 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c5e63ba7/1c49e54c107f46179db349be1aef9378/FLAGc83489034 [2025-01-09 03:57:18,737 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:57:18,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product26.cil.c [2025-01-09 03:57:18,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c5e63ba7/1c49e54c107f46179db349be1aef9378/FLAGc83489034 [2025-01-09 03:57:18,979 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c5e63ba7/1c49e54c107f46179db349be1aef9378 [2025-01-09 03:57:18,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:57:18,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:57:18,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:57:18,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:57:18,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:57:18,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:57:18" (1/1) ... [2025-01-09 03:57:18,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@763e76c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:18, skipping insertion in model container [2025-01-09 03:57:18,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:57:18" (1/1) ... [2025-01-09 03:57:19,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:57:19,233 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product26.cil.c[14808,14821] [2025-01-09 03:57:19,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:57:19,429 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:57:19,442 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-01-09 03:57:19,443 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [392] [2025-01-09 03:57:19,443 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [436] [2025-01-09 03:57:19,443 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [794] [2025-01-09 03:57:19,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [803] [2025-01-09 03:57:19,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1169] [2025-01-09 03:57:19,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1391] [2025-01-09 03:57:19,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1426] [2025-01-09 03:57:19,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1443] [2025-01-09 03:57:19,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1847] [2025-01-09 03:57:19,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1950] [2025-01-09 03:57:19,471 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product26.cil.c[14808,14821] [2025-01-09 03:57:19,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:57:19,564 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:57:19,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:19 WrapperNode [2025-01-09 03:57:19,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:57:19,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:57:19,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:57:19,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:57:19,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:19" (1/1) ... [2025-01-09 03:57:19,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:19" (1/1) ... [2025-01-09 03:57:19,646 INFO L138 Inliner]: procedures = 132, calls = 208, calls flagged for inlining = 61, calls inlined = 58, statements flattened = 1109 [2025-01-09 03:57:19,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:57:19,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:57:19,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:57:19,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:57:19,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:19" (1/1) ... [2025-01-09 03:57:19,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:19" (1/1) ... [2025-01-09 03:57:19,666 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:19" (1/1) ... [2025-01-09 03:57:19,684 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-01-09 03:57:19,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:19" (1/1) ... [2025-01-09 03:57:19,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:19" (1/1) ... [2025-01-09 03:57:19,699 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:19" (1/1) ... [2025-01-09 03:57:19,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:19" (1/1) ... [2025-01-09 03:57:19,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:19" (1/1) ... [2025-01-09 03:57:19,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:19" (1/1) ... [2025-01-09 03:57:19,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:19" (1/1) ... [2025-01-09 03:57:19,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:57:19,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:57:19,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:57:19,716 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:57:19,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:19" (1/1) ... [2025-01-09 03:57:19,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:57:19,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:57:19,745 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:57:19,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:57:19,783 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-01-09 03:57:19,783 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-01-09 03:57:19,783 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:57:19,783 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:57:19,783 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-01-09 03:57:19,783 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-01-09 03:57:19,783 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:57:19,783 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:57:19,783 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:57:19,783 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:57:19,783 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-01-09 03:57:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-01-09 03:57:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:57:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:57:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:57:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:57:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:57:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:57:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:57:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:57:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:57:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:57:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-01-09 03:57:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-01-09 03:57:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:57:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:57:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:57:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-01-09 03:57:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-01-09 03:57:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:57:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:57:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:57:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:57:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:57:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:57:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:57:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:57:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:57:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:57:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:57:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:57:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:57:19,785 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:57:19,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:57:19,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:57:19,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:57:19,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:57:19,785 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:57:19,785 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:57:19,785 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-01-09 03:57:19,785 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-01-09 03:57:19,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:57:19,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:57:19,961 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:57:19,963 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:57:20,848 INFO L? ?]: Removed 546 outVars from TransFormulas that were not future-live. [2025-01-09 03:57:20,848 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:57:20,862 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:57:20,863 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:57:20,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:57:20 BoogieIcfgContainer [2025-01-09 03:57:20,863 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:57:20,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:57:20,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:57:20,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:57:20,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:57:18" (1/3) ... [2025-01-09 03:57:20,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efbe3c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:57:20, skipping insertion in model container [2025-01-09 03:57:20,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:19" (2/3) ... [2025-01-09 03:57:20,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efbe3c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:57:20, skipping insertion in model container [2025-01-09 03:57:20,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:57:20" (3/3) ... [2025-01-09 03:57:20,872 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec8_product26.cil.c [2025-01-09 03:57:20,886 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:57:20,895 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec8_product26.cil.c that has 24 procedures, 399 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:57:20,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:57:20,959 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@24d8e51a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:57:20,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:57:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 399 states, 312 states have (on average 1.560897435897436) internal successors, (487), 317 states have internal predecessors, (487), 62 states have call successors, (62), 23 states have call predecessors, (62), 23 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 03:57:20,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 03:57:20,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:20,979 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:20,979 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:20,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:20,983 INFO L85 PathProgramCache]: Analyzing trace with hash 750820406, now seen corresponding path program 1 times [2025-01-09 03:57:20,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:20,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294040127] [2025-01-09 03:57:20,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:20,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:21,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:57:21,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:57:21,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:21,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:21,486 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 03:57:21,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:21,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294040127] [2025-01-09 03:57:21,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294040127] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:57:21,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079854578] [2025-01-09 03:57:21,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:21,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:21,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:57:21,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:57:21,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:57:21,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:57:21,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:57:21,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:21,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:21,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 03:57:21,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:57:21,828 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:57:21,828 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:57:21,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079854578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:21,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:57:21,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-01-09 03:57:21,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5059416] [2025-01-09 03:57:21,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:21,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:57:21,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:21,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:57:21,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:21,857 INFO L87 Difference]: Start difference. First operand has 399 states, 312 states have (on average 1.560897435897436) internal successors, (487), 317 states have internal predecessors, (487), 62 states have call successors, (62), 23 states have call predecessors, (62), 23 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:21,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:21,910 INFO L93 Difference]: Finished difference Result 601 states and 906 transitions. [2025-01-09 03:57:21,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:57:21,912 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2025-01-09 03:57:21,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:21,920 INFO L225 Difference]: With dead ends: 601 [2025-01-09 03:57:21,920 INFO L226 Difference]: Without dead ends: 392 [2025-01-09 03:57:21,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:21,925 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:21,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:21,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-01-09 03:57:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-01-09 03:57:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 306 states have (on average 1.5588235294117647) internal successors, (477), 310 states have internal predecessors, (477), 62 states have call successors, (62), 23 states have call predecessors, (62), 23 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 03:57:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 600 transitions. [2025-01-09 03:57:21,969 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 600 transitions. Word has length 98 [2025-01-09 03:57:21,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:21,970 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 600 transitions. [2025-01-09 03:57:21,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:21,970 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 600 transitions. [2025-01-09 03:57:21,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 03:57:21,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:21,980 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:21,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:57:22,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 03:57:22,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:22,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:22,182 INFO L85 PathProgramCache]: Analyzing trace with hash -880013504, now seen corresponding path program 1 times [2025-01-09 03:57:22,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:22,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190132396] [2025-01-09 03:57:22,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:22,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:22,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:57:22,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:57:22,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:22,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 03:57:22,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:22,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190132396] [2025-01-09 03:57:22,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190132396] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:57:22,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868875058] [2025-01-09 03:57:22,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:22,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:22,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:57:22,449 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:57:22,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:57:22,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:57:22,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:57:22,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:22,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:22,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:57:22,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:57:22,750 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:57:22,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:57:22,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868875058] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:22,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:57:22,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:57:22,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336825698] [2025-01-09 03:57:22,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:22,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:22,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:22,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:22,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:57:22,753 INFO L87 Difference]: Start difference. First operand 392 states and 600 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:22,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:22,795 INFO L93 Difference]: Finished difference Result 590 states and 884 transitions. [2025-01-09 03:57:22,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:22,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2025-01-09 03:57:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:22,799 INFO L225 Difference]: With dead ends: 590 [2025-01-09 03:57:22,799 INFO L226 Difference]: Without dead ends: 394 [2025-01-09 03:57:22,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:57:22,804 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:22,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1194 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:22,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-01-09 03:57:22,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2025-01-09 03:57:22,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 307 states have (on average 1.5570032573289903) internal successors, (478), 311 states have internal predecessors, (478), 62 states have call successors, (62), 23 states have call predecessors, (62), 23 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 03:57:22,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 601 transitions. [2025-01-09 03:57:22,839 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 601 transitions. Word has length 98 [2025-01-09 03:57:22,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:22,839 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 601 transitions. [2025-01-09 03:57:22,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:22,839 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 601 transitions. [2025-01-09 03:57:22,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 03:57:22,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:22,841 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:22,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:57:23,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:23,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:23,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:23,043 INFO L85 PathProgramCache]: Analyzing trace with hash -335574701, now seen corresponding path program 1 times [2025-01-09 03:57:23,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:23,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053903815] [2025-01-09 03:57:23,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:23,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:23,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:57:23,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:57:23,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:23,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:23,360 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:57:23,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:23,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053903815] [2025-01-09 03:57:23,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053903815] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:57:23,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91469339] [2025-01-09 03:57:23,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:23,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:23,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:57:23,364 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:57:23,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:57:23,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:57:23,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:57:23,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:23,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:23,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:57:23,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:57:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:57:23,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:57:23,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91469339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:23,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:57:23,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:57:23,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882395859] [2025-01-09 03:57:23,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:23,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:23,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:23,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:23,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:57:23,659 INFO L87 Difference]: Start difference. First operand 393 states and 601 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:23,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:23,720 INFO L93 Difference]: Finished difference Result 839 states and 1302 transitions. [2025-01-09 03:57:23,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:23,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 106 [2025-01-09 03:57:23,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:23,724 INFO L225 Difference]: With dead ends: 839 [2025-01-09 03:57:23,724 INFO L226 Difference]: Without dead ends: 472 [2025-01-09 03:57:23,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:57:23,726 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 142 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:23,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1174 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:23,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-01-09 03:57:23,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 464. [2025-01-09 03:57:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 364 states have (on average 1.5769230769230769) internal successors, (574), 368 states have internal predecessors, (574), 76 states have call successors, (76), 23 states have call predecessors, (76), 23 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-09 03:57:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 725 transitions. [2025-01-09 03:57:23,744 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 725 transitions. Word has length 106 [2025-01-09 03:57:23,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:23,744 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 725 transitions. [2025-01-09 03:57:23,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:23,745 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 725 transitions. [2025-01-09 03:57:23,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:57:23,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:23,747 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:23,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:57:23,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:23,948 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:23,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:23,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1838734310, now seen corresponding path program 1 times [2025-01-09 03:57:23,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:23,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784460723] [2025-01-09 03:57:23,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:23,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:23,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:57:23,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:57:23,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:23,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:24,138 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:57:24,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:24,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784460723] [2025-01-09 03:57:24,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784460723] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:57:24,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616322905] [2025-01-09 03:57:24,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:24,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:24,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:57:24,143 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:57:24,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:57:24,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:57:24,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:57:24,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:24,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:24,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:57:24,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:57:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:57:24,449 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:57:24,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616322905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:24,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:57:24,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:57:24,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061670035] [2025-01-09 03:57:24,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:24,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:57:24,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:24,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:57:24,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:57:24,451 INFO L87 Difference]: Start difference. First operand 464 states and 725 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:24,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:24,506 INFO L93 Difference]: Finished difference Result 919 states and 1440 transitions. [2025-01-09 03:57:24,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:57:24,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 107 [2025-01-09 03:57:24,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:24,511 INFO L225 Difference]: With dead ends: 919 [2025-01-09 03:57:24,511 INFO L226 Difference]: Without dead ends: 466 [2025-01-09 03:57:24,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:57:24,513 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 2 mSDsluCounter, 1765 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:24,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2357 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-01-09 03:57:24,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2025-01-09 03:57:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 365 states have (on average 1.5753424657534247) internal successors, (575), 370 states have internal predecessors, (575), 76 states have call successors, (76), 23 states have call predecessors, (76), 24 states have return successors, (77), 74 states have call predecessors, (77), 75 states have call successors, (77) [2025-01-09 03:57:24,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 728 transitions. [2025-01-09 03:57:24,533 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 728 transitions. Word has length 107 [2025-01-09 03:57:24,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:24,535 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 728 transitions. [2025-01-09 03:57:24,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:24,535 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 728 transitions. [2025-01-09 03:57:24,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 03:57:24,539 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:24,539 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-01-09 03:57:24,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:57:24,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:24,740 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:24,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:24,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2048750439, now seen corresponding path program 1 times [2025-01-09 03:57:24,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:24,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840832667] [2025-01-09 03:57:24,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:24,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:24,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:57:24,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:57:24,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:24,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:24,895 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 03:57:24,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:24,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840832667] [2025-01-09 03:57:24,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840832667] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:57:24,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918756242] [2025-01-09 03:57:24,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:24,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:24,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:57:24,898 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:57:24,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:57:25,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:57:25,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:57:25,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:25,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:25,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:57:25,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:57:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:57:25,185 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:57:25,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918756242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:25,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:57:25,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:57:25,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857923759] [2025-01-09 03:57:25,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:25,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:57:25,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:25,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:57:25,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:57:25,188 INFO L87 Difference]: Start difference. First operand 466 states and 728 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:25,250 INFO L93 Difference]: Finished difference Result 921 states and 1445 transitions. [2025-01-09 03:57:25,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:57:25,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-01-09 03:57:25,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:25,254 INFO L225 Difference]: With dead ends: 921 [2025-01-09 03:57:25,254 INFO L226 Difference]: Without dead ends: 468 [2025-01-09 03:57:25,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:57:25,257 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 2 mSDsluCounter, 1753 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2343 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:25,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2343 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-01-09 03:57:25,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-01-09 03:57:25,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 366 states have (on average 1.5737704918032787) internal successors, (576), 372 states have internal predecessors, (576), 76 states have call successors, (76), 23 states have call predecessors, (76), 25 states have return successors, (82), 74 states have call predecessors, (82), 75 states have call successors, (82) [2025-01-09 03:57:25,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 734 transitions. [2025-01-09 03:57:25,279 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 734 transitions. Word has length 108 [2025-01-09 03:57:25,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:25,282 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 734 transitions. [2025-01-09 03:57:25,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 734 transitions. [2025-01-09 03:57:25,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:57:25,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:25,284 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-01-09 03:57:25,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:57:25,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:25,486 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:25,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:25,487 INFO L85 PathProgramCache]: Analyzing trace with hash -199575433, now seen corresponding path program 1 times [2025-01-09 03:57:25,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:25,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713338871] [2025-01-09 03:57:25,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:25,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:25,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:57:25,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:57:25,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:25,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:25,646 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:57:25,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:25,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713338871] [2025-01-09 03:57:25,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713338871] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:25,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:25,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:57:25,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785712697] [2025-01-09 03:57:25,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:25,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:57:25,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:25,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:57:25,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:25,648 INFO L87 Difference]: Start difference. First operand 468 states and 734 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:25,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:25,685 INFO L93 Difference]: Finished difference Result 913 states and 1436 transitions. [2025-01-09 03:57:25,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:57:25,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2025-01-09 03:57:25,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:25,688 INFO L225 Difference]: With dead ends: 913 [2025-01-09 03:57:25,689 INFO L226 Difference]: Without dead ends: 468 [2025-01-09 03:57:25,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:25,690 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 2 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2361 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:25,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2361 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:25,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-01-09 03:57:25,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-01-09 03:57:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 366 states have (on average 1.5737704918032787) internal successors, (576), 372 states have internal predecessors, (576), 76 states have call successors, (76), 23 states have call predecessors, (76), 25 states have return successors, (81), 74 states have call predecessors, (81), 75 states have call successors, (81) [2025-01-09 03:57:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 733 transitions. [2025-01-09 03:57:25,705 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 733 transitions. Word has length 109 [2025-01-09 03:57:25,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:25,706 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 733 transitions. [2025-01-09 03:57:25,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 733 transitions. [2025-01-09 03:57:25,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 03:57:25,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:25,708 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:25,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:57:25,708 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:25,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:25,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1056174934, now seen corresponding path program 2 times [2025-01-09 03:57:25,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:25,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853926144] [2025-01-09 03:57:25,709 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:57:25,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:25,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-01-09 03:57:25,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:57:25,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:57:25,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:25,810 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:57:25,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:25,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853926144] [2025-01-09 03:57:25,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853926144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:25,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:25,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:57:25,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212332668] [2025-01-09 03:57:25,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:25,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:57:25,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:25,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:57:25,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:25,811 INFO L87 Difference]: Start difference. First operand 468 states and 733 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:25,857 INFO L93 Difference]: Finished difference Result 911 states and 1431 transitions. [2025-01-09 03:57:25,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:57:25,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2025-01-09 03:57:25,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:25,860 INFO L225 Difference]: With dead ends: 911 [2025-01-09 03:57:25,860 INFO L226 Difference]: Without dead ends: 468 [2025-01-09 03:57:25,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:25,862 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 2 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2347 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:25,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2347 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:25,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-01-09 03:57:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-01-09 03:57:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 366 states have (on average 1.5737704918032787) internal successors, (576), 372 states have internal predecessors, (576), 76 states have call successors, (76), 23 states have call predecessors, (76), 25 states have return successors, (80), 74 states have call predecessors, (80), 75 states have call successors, (80) [2025-01-09 03:57:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 732 transitions. [2025-01-09 03:57:25,876 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 732 transitions. Word has length 110 [2025-01-09 03:57:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:25,876 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 732 transitions. [2025-01-09 03:57:25,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 732 transitions. [2025-01-09 03:57:25,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 03:57:25,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:25,878 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:25,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:57:25,878 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:25,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:25,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1660608004, now seen corresponding path program 3 times [2025-01-09 03:57:25,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:25,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433545693] [2025-01-09 03:57:25,879 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:57:25,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:25,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 111 statements into 3 equivalence classes. [2025-01-09 03:57:25,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 99 of 111 statements. [2025-01-09 03:57:25,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:57:25,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:57:25,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:25,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433545693] [2025-01-09 03:57:25,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433545693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:25,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:25,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:57:25,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328693894] [2025-01-09 03:57:25,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:25,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:57:25,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:25,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:57:25,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:25,967 INFO L87 Difference]: Start difference. First operand 468 states and 732 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:26,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:26,013 INFO L93 Difference]: Finished difference Result 913 states and 1437 transitions. [2025-01-09 03:57:26,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:57:26,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2025-01-09 03:57:26,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:26,016 INFO L225 Difference]: With dead ends: 913 [2025-01-09 03:57:26,016 INFO L226 Difference]: Without dead ends: 470 [2025-01-09 03:57:26,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:26,018 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 1 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:26,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2358 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:26,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-01-09 03:57:26,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2025-01-09 03:57:26,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 367 states have (on average 1.5722070844686649) internal successors, (577), 374 states have internal predecessors, (577), 76 states have call successors, (76), 23 states have call predecessors, (76), 26 states have return successors, (85), 74 states have call predecessors, (85), 75 states have call successors, (85) [2025-01-09 03:57:26,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 738 transitions. [2025-01-09 03:57:26,034 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 738 transitions. Word has length 111 [2025-01-09 03:57:26,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:26,034 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 738 transitions. [2025-01-09 03:57:26,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:26,034 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 738 transitions. [2025-01-09 03:57:26,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:57:26,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:26,036 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:26,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:57:26,036 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:26,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:26,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1986598555, now seen corresponding path program 1 times [2025-01-09 03:57:26,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:26,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236696298] [2025-01-09 03:57:26,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:26,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:26,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:57:26,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:57:26,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:26,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:26,163 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:57:26,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:26,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236696298] [2025-01-09 03:57:26,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236696298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:26,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:26,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:57:26,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027713687] [2025-01-09 03:57:26,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:26,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:57:26,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:26,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:57:26,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:26,164 INFO L87 Difference]: Start difference. First operand 470 states and 738 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:26,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:26,203 INFO L93 Difference]: Finished difference Result 919 states and 1447 transitions. [2025-01-09 03:57:26,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:57:26,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2025-01-09 03:57:26,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:26,206 INFO L225 Difference]: With dead ends: 919 [2025-01-09 03:57:26,206 INFO L226 Difference]: Without dead ends: 472 [2025-01-09 03:57:26,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:26,208 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 1 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2364 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:26,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2364 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:26,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-01-09 03:57:26,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2025-01-09 03:57:26,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 368 states have (on average 1.5706521739130435) internal successors, (578), 376 states have internal predecessors, (578), 76 states have call successors, (76), 23 states have call predecessors, (76), 27 states have return successors, (87), 74 states have call predecessors, (87), 75 states have call successors, (87) [2025-01-09 03:57:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 741 transitions. [2025-01-09 03:57:26,223 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 741 transitions. Word has length 112 [2025-01-09 03:57:26,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:26,223 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 741 transitions. [2025-01-09 03:57:26,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 741 transitions. [2025-01-09 03:57:26,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:57:26,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:26,225 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1] [2025-01-09 03:57:26,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:57:26,226 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:26,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:26,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1346669599, now seen corresponding path program 1 times [2025-01-09 03:57:26,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:26,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916325320] [2025-01-09 03:57:26,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:26,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:26,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:57:26,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:57:26,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:26,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:57:26,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:26,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916325320] [2025-01-09 03:57:26,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916325320] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:57:26,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952822820] [2025-01-09 03:57:26,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:26,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:26,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:57:26,350 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:57:26,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:57:26,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:57:26,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:57:26,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:26,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:26,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:57:26,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:57:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:26,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:57:26,696 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:26,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952822820] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:57:26,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:57:26,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-01-09 03:57:26,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646400501] [2025-01-09 03:57:26,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:57:26,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:57:26,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:26,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:57:26,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:57:26,697 INFO L87 Difference]: Start difference. First operand 472 states and 741 transitions. Second operand has 11 states, 10 states have (on average 11.9) internal successors, (119), 11 states have internal predecessors, (119), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-01-09 03:57:27,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:27,304 INFO L93 Difference]: Finished difference Result 1379 states and 2252 transitions. [2025-01-09 03:57:27,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:57:27,304 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.9) internal successors, (119), 11 states have internal predecessors, (119), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 113 [2025-01-09 03:57:27,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:27,311 INFO L225 Difference]: With dead ends: 1379 [2025-01-09 03:57:27,312 INFO L226 Difference]: Without dead ends: 935 [2025-01-09 03:57:27,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-01-09 03:57:27,315 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 1430 mSDsluCounter, 3685 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1430 SdHoareTripleChecker+Valid, 4281 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:27,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1430 Valid, 4281 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:57:27,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-01-09 03:57:27,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 911. [2025-01-09 03:57:27,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 728 states have (on average 1.620879120879121) internal successors, (1180), 735 states have internal predecessors, (1180), 155 states have call successors, (155), 24 states have call predecessors, (155), 27 states have return successors, (176), 153 states have call predecessors, (176), 154 states have call successors, (176) [2025-01-09 03:57:27,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1511 transitions. [2025-01-09 03:57:27,351 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1511 transitions. Word has length 113 [2025-01-09 03:57:27,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:27,351 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1511 transitions. [2025-01-09 03:57:27,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.9) internal successors, (119), 11 states have internal predecessors, (119), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-01-09 03:57:27,352 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1511 transitions. [2025-01-09 03:57:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 03:57:27,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:27,356 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2025-01-09 03:57:27,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 03:57:27,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 03:57:27,557 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:27,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:27,558 INFO L85 PathProgramCache]: Analyzing trace with hash -908516120, now seen corresponding path program 1 times [2025-01-09 03:57:27,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:27,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085404525] [2025-01-09 03:57:27,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:27,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:27,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 03:57:27,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 03:57:27,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:27,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:27,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:27,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085404525] [2025-01-09 03:57:27,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085404525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:27,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:27,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:27,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778082111] [2025-01-09 03:57:27,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:27,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:27,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:27,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:27,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:27,614 INFO L87 Difference]: Start difference. First operand 911 states and 1511 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:27,658 INFO L93 Difference]: Finished difference Result 2160 states and 3638 transitions. [2025-01-09 03:57:27,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:27,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2025-01-09 03:57:27,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:27,667 INFO L225 Difference]: With dead ends: 2160 [2025-01-09 03:57:27,668 INFO L226 Difference]: Without dead ends: 1327 [2025-01-09 03:57:27,671 INFO L434 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 [2025-01-09 03:57:27,671 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 139 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:27,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1210 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:27,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2025-01-09 03:57:27,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1319. [2025-01-09 03:57:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1057 states have (on average 1.6395458845789972) internal successors, (1733), 1064 states have internal predecessors, (1733), 234 states have call successors, (234), 24 states have call predecessors, (234), 27 states have return successors, (265), 232 states have call predecessors, (265), 233 states have call successors, (265) [2025-01-09 03:57:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 2232 transitions. [2025-01-09 03:57:27,730 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 2232 transitions. Word has length 117 [2025-01-09 03:57:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:27,730 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 2232 transitions. [2025-01-09 03:57:27,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:27,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 2232 transitions. [2025-01-09 03:57:27,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 03:57:27,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:27,738 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:27,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:57:27,738 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:27,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:27,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2144711228, now seen corresponding path program 1 times [2025-01-09 03:57:27,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:27,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872071303] [2025-01-09 03:57:27,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:27,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:27,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:57:27,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:57:27,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:27,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:27,792 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:27,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:27,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872071303] [2025-01-09 03:57:27,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872071303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:27,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:27,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:27,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134780556] [2025-01-09 03:57:27,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:27,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:27,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:27,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:27,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:27,793 INFO L87 Difference]: Start difference. First operand 1319 states and 2232 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:27,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:27,847 INFO L93 Difference]: Finished difference Result 3182 states and 5418 transitions. [2025-01-09 03:57:27,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:27,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-01-09 03:57:27,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:27,857 INFO L225 Difference]: With dead ends: 3182 [2025-01-09 03:57:27,858 INFO L226 Difference]: Without dead ends: 1992 [2025-01-09 03:57:27,862 INFO L434 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 [2025-01-09 03:57:27,862 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 137 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:27,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1194 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:27,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2025-01-09 03:57:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1984. [2025-01-09 03:57:27,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1984 states, 1603 states have (on average 1.6487835308796008) internal successors, (2643), 1610 states have internal predecessors, (2643), 353 states have call successors, (353), 24 states have call predecessors, (353), 27 states have return successors, (384), 351 states have call predecessors, (384), 352 states have call successors, (384) [2025-01-09 03:57:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 3380 transitions. [2025-01-09 03:57:27,979 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 3380 transitions. Word has length 118 [2025-01-09 03:57:27,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:27,979 INFO L471 AbstractCegarLoop]: Abstraction has 1984 states and 3380 transitions. [2025-01-09 03:57:27,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:27,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 3380 transitions. [2025-01-09 03:57:27,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 03:57:27,990 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:27,990 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:27,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:57:27,991 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:27,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:27,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1537966630, now seen corresponding path program 1 times [2025-01-09 03:57:27,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:27,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739264370] [2025-01-09 03:57:27,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:27,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:28,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:57:28,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:57:28,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:28,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:28,047 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:28,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:28,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739264370] [2025-01-09 03:57:28,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739264370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:28,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:28,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:28,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380318842] [2025-01-09 03:57:28,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:28,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:28,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:28,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:28,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:28,049 INFO L87 Difference]: Start difference. First operand 1984 states and 3380 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:28,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:28,127 INFO L93 Difference]: Finished difference Result 4739 states and 8135 transitions. [2025-01-09 03:57:28,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:28,127 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), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-01-09 03:57:28,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:28,142 INFO L225 Difference]: With dead ends: 4739 [2025-01-09 03:57:28,143 INFO L226 Difference]: Without dead ends: 3015 [2025-01-09 03:57:28,149 INFO L434 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 [2025-01-09 03:57:28,150 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 135 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:28,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1187 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2025-01-09 03:57:28,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 3007. [2025-01-09 03:57:28,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 2464 states have (on average 1.65625) internal successors, (4081), 2471 states have internal predecessors, (4081), 515 states have call successors, (515), 24 states have call predecessors, (515), 27 states have return successors, (562), 513 states have call predecessors, (562), 514 states have call successors, (562) [2025-01-09 03:57:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 5158 transitions. [2025-01-09 03:57:28,269 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 5158 transitions. Word has length 119 [2025-01-09 03:57:28,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:28,269 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 5158 transitions. [2025-01-09 03:57:28,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:28,270 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 5158 transitions. [2025-01-09 03:57:28,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:57:28,280 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:28,280 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:28,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:57:28,281 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:28,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:28,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1779146619, now seen corresponding path program 1 times [2025-01-09 03:57:28,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:28,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000680041] [2025-01-09 03:57:28,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:28,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:28,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:57:28,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:57:28,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:28,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:28,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:28,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000680041] [2025-01-09 03:57:28,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000680041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:28,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:28,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:28,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267104361] [2025-01-09 03:57:28,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:28,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:28,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:28,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:28,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:28,370 INFO L87 Difference]: Start difference. First operand 3007 states and 5158 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:28,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:28,475 INFO L93 Difference]: Finished difference Result 7207 states and 12447 transitions. [2025-01-09 03:57:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:28,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-01-09 03:57:28,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:28,500 INFO L225 Difference]: With dead ends: 7207 [2025-01-09 03:57:28,500 INFO L226 Difference]: Without dead ends: 4672 [2025-01-09 03:57:28,511 INFO L434 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 [2025-01-09 03:57:28,512 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 133 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:28,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1187 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:28,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4672 states. [2025-01-09 03:57:28,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4672 to 4664. [2025-01-09 03:57:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4664 states, 3876 states have (on average 1.6615067079463364) internal successors, (6440), 3883 states have internal predecessors, (6440), 760 states have call successors, (760), 24 states have call predecessors, (760), 27 states have return successors, (833), 758 states have call predecessors, (833), 759 states have call successors, (833) [2025-01-09 03:57:28,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 8033 transitions. [2025-01-09 03:57:28,705 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 8033 transitions. Word has length 120 [2025-01-09 03:57:28,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:28,705 INFO L471 AbstractCegarLoop]: Abstraction has 4664 states and 8033 transitions. [2025-01-09 03:57:28,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 8033 transitions. [2025-01-09 03:57:28,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 03:57:28,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:28,719 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:28,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:57:28,719 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:28,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:28,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1956243106, now seen corresponding path program 1 times [2025-01-09 03:57:28,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:28,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607473160] [2025-01-09 03:57:28,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:28,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:28,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 03:57:28,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 03:57:28,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:28,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:28,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:28,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607473160] [2025-01-09 03:57:28,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607473160] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:28,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:28,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:28,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310758392] [2025-01-09 03:57:28,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:28,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:28,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:28,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:28,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:28,835 INFO L87 Difference]: Start difference. First operand 4664 states and 8033 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:28,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:28,998 INFO L93 Difference]: Finished difference Result 11331 states and 19647 transitions. [2025-01-09 03:57:28,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:28,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-01-09 03:57:28,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:29,049 INFO L225 Difference]: With dead ends: 11331 [2025-01-09 03:57:29,049 INFO L226 Difference]: Without dead ends: 7460 [2025-01-09 03:57:29,065 INFO L434 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 [2025-01-09 03:57:29,065 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 131 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:29,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1197 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:29,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7460 states. [2025-01-09 03:57:29,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7460 to 7452. [2025-01-09 03:57:29,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7452 states, 6171 states have (on average 1.6600226867606547) internal successors, (10244), 6178 states have internal predecessors, (10244), 1253 states have call successors, (1253), 24 states have call predecessors, (1253), 27 states have return successors, (1370), 1251 states have call predecessors, (1370), 1252 states have call successors, (1370) [2025-01-09 03:57:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7452 states to 7452 states and 12867 transitions. [2025-01-09 03:57:29,415 INFO L78 Accepts]: Start accepts. Automaton has 7452 states and 12867 transitions. Word has length 121 [2025-01-09 03:57:29,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:29,416 INFO L471 AbstractCegarLoop]: Abstraction has 7452 states and 12867 transitions. [2025-01-09 03:57:29,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:29,416 INFO L276 IsEmpty]: Start isEmpty. Operand 7452 states and 12867 transitions. [2025-01-09 03:57:29,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 03:57:29,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:29,435 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:29,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:57:29,435 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:29,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:29,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1208944649, now seen corresponding path program 1 times [2025-01-09 03:57:29,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:29,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240617227] [2025-01-09 03:57:29,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:29,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:29,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 03:57:29,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 03:57:29,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:29,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:29,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:29,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240617227] [2025-01-09 03:57:29,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240617227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:29,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:29,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:29,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566971574] [2025-01-09 03:57:29,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:29,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:29,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:29,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:29,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:29,489 INFO L87 Difference]: Start difference. First operand 7452 states and 12867 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:29,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:29,899 INFO L93 Difference]: Finished difference Result 18813 states and 32679 transitions. [2025-01-09 03:57:29,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:29,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-01-09 03:57:29,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:29,958 INFO L225 Difference]: With dead ends: 18813 [2025-01-09 03:57:29,958 INFO L226 Difference]: Without dead ends: 12540 [2025-01-09 03:57:29,985 INFO L434 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 [2025-01-09 03:57:29,987 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 129 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:29,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1202 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:29,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12540 states. [2025-01-09 03:57:30,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12540 to 12532. [2025-01-09 03:57:30,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12532 states, 10429 states have (on average 1.6600824623645603) internal successors, (17313), 10436 states have internal predecessors, (17313), 2075 states have call successors, (2075), 24 states have call predecessors, (2075), 27 states have return successors, (2270), 2073 states have call predecessors, (2270), 2074 states have call successors, (2270) [2025-01-09 03:57:30,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12532 states to 12532 states and 21658 transitions. [2025-01-09 03:57:30,735 INFO L78 Accepts]: Start accepts. Automaton has 12532 states and 21658 transitions. Word has length 122 [2025-01-09 03:57:30,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:30,736 INFO L471 AbstractCegarLoop]: Abstraction has 12532 states and 21658 transitions. [2025-01-09 03:57:30,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:30,736 INFO L276 IsEmpty]: Start isEmpty. Operand 12532 states and 21658 transitions. [2025-01-09 03:57:30,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 03:57:30,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:30,758 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:30,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:57:30,758 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:30,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:30,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2040046576, now seen corresponding path program 1 times [2025-01-09 03:57:30,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:30,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187900704] [2025-01-09 03:57:30,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:30,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:30,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 03:57:30,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:57:30,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:30,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:30,804 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:30,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:30,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187900704] [2025-01-09 03:57:30,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187900704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:30,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:30,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:30,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282517047] [2025-01-09 03:57:30,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:30,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:30,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:30,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:30,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:30,806 INFO L87 Difference]: Start difference. First operand 12532 states and 21658 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:31,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:31,267 INFO L93 Difference]: Finished difference Result 30058 states and 51860 transitions. [2025-01-09 03:57:31,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:31,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2025-01-09 03:57:31,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:31,341 INFO L225 Difference]: With dead ends: 30058 [2025-01-09 03:57:31,342 INFO L226 Difference]: Without dead ends: 19687 [2025-01-09 03:57:31,373 INFO L434 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 [2025-01-09 03:57:31,374 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 127 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:31,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1164 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19687 states. [2025-01-09 03:57:31,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19687 to 19679. [2025-01-09 03:57:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19679 states, 16373 states have (on average 1.6364136077688878) internal successors, (26793), 16380 states have internal predecessors, (26793), 3278 states have call successors, (3278), 24 states have call predecessors, (3278), 27 states have return successors, (3617), 3276 states have call predecessors, (3617), 3277 states have call successors, (3617) [2025-01-09 03:57:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19679 states to 19679 states and 33688 transitions. [2025-01-09 03:57:32,092 INFO L78 Accepts]: Start accepts. Automaton has 19679 states and 33688 transitions. Word has length 123 [2025-01-09 03:57:32,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:32,092 INFO L471 AbstractCegarLoop]: Abstraction has 19679 states and 33688 transitions. [2025-01-09 03:57:32,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:32,092 INFO L276 IsEmpty]: Start isEmpty. Operand 19679 states and 33688 transitions. [2025-01-09 03:57:32,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 03:57:32,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:32,119 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:32,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:57:32,119 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:32,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:32,120 INFO L85 PathProgramCache]: Analyzing trace with hash -46036970, now seen corresponding path program 1 times [2025-01-09 03:57:32,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:32,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884173428] [2025-01-09 03:57:32,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:32,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:32,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 03:57:32,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 03:57:32,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:32,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:32,171 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:32,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:32,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884173428] [2025-01-09 03:57:32,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884173428] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:32,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:32,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:32,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999113881] [2025-01-09 03:57:32,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:32,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:32,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:32,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:32,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:32,173 INFO L87 Difference]: Start difference. First operand 19679 states and 33688 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:33,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:33,155 INFO L93 Difference]: Finished difference Result 52060 states and 89414 transitions. [2025-01-09 03:57:33,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:33,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2025-01-09 03:57:33,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:33,289 INFO L225 Difference]: With dead ends: 52060 [2025-01-09 03:57:33,289 INFO L226 Difference]: Without dead ends: 35190 [2025-01-09 03:57:33,347 INFO L434 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 [2025-01-09 03:57:33,347 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 125 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:33,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1190 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:33,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35190 states. [2025-01-09 03:57:34,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35190 to 35182. [2025-01-09 03:57:34,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35182 states, 29426 states have (on average 1.6329776388228097) internal successors, (48052), 29433 states have internal predecessors, (48052), 5728 states have call successors, (5728), 24 states have call predecessors, (5728), 27 states have return successors, (6341), 5726 states have call predecessors, (6341), 5727 states have call successors, (6341) [2025-01-09 03:57:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35182 states to 35182 states and 60121 transitions. [2025-01-09 03:57:34,671 INFO L78 Accepts]: Start accepts. Automaton has 35182 states and 60121 transitions. Word has length 124 [2025-01-09 03:57:34,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:34,671 INFO L471 AbstractCegarLoop]: Abstraction has 35182 states and 60121 transitions. [2025-01-09 03:57:34,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 35182 states and 60121 transitions. [2025-01-09 03:57:34,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 03:57:34,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:34,700 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:34,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:57:34,701 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:34,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:34,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1857770538, now seen corresponding path program 1 times [2025-01-09 03:57:34,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:34,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84298755] [2025-01-09 03:57:34,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:34,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:34,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:57:34,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:57:34,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:34,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:34,755 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:34,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:34,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84298755] [2025-01-09 03:57:34,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84298755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:34,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:34,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:34,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847112721] [2025-01-09 03:57:34,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:34,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:34,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:34,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:34,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:34,757 INFO L87 Difference]: Start difference. First operand 35182 states and 60121 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:36,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:36,182 INFO L93 Difference]: Finished difference Result 96072 states and 164606 transitions. [2025-01-09 03:57:36,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:36,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2025-01-09 03:57:36,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:36,458 INFO L225 Difference]: With dead ends: 96072 [2025-01-09 03:57:36,458 INFO L226 Difference]: Without dead ends: 64618 [2025-01-09 03:57:36,554 INFO L434 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 [2025-01-09 03:57:36,555 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 123 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:36,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1199 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:36,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64618 states. [2025-01-09 03:57:38,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64618 to 64610. [2025-01-09 03:57:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64610 states, 54341 states have (on average 1.6285309434865018) internal successors, (88496), 54348 states have internal predecessors, (88496), 10241 states have call successors, (10241), 24 states have call predecessors, (10241), 27 states have return successors, (11386), 10239 states have call predecessors, (11386), 10240 states have call successors, (11386) [2025-01-09 03:57:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64610 states to 64610 states and 110123 transitions. [2025-01-09 03:57:39,358 INFO L78 Accepts]: Start accepts. Automaton has 64610 states and 110123 transitions. Word has length 125 [2025-01-09 03:57:39,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:39,358 INFO L471 AbstractCegarLoop]: Abstraction has 64610 states and 110123 transitions. [2025-01-09 03:57:39,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:39,359 INFO L276 IsEmpty]: Start isEmpty. Operand 64610 states and 110123 transitions. [2025-01-09 03:57:39,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 03:57:39,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:39,385 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:39,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:57:39,385 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:39,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:39,385 INFO L85 PathProgramCache]: Analyzing trace with hash 38940086, now seen corresponding path program 1 times [2025-01-09 03:57:39,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:39,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553445143] [2025-01-09 03:57:39,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:39,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:39,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 03:57:39,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 03:57:39,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:39,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:39,443 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:39,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:39,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553445143] [2025-01-09 03:57:39,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553445143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:39,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:39,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:39,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776324488] [2025-01-09 03:57:39,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:39,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:39,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:39,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:39,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:39,444 INFO L87 Difference]: Start difference. First operand 64610 states and 110123 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:41,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:41,539 INFO L93 Difference]: Finished difference Result 121214 states and 206951 transitions. [2025-01-09 03:57:41,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:41,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2025-01-09 03:57:41,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:42,172 INFO L225 Difference]: With dead ends: 121214 [2025-01-09 03:57:42,172 INFO L226 Difference]: Without dead ends: 121018 [2025-01-09 03:57:42,234 INFO L434 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 [2025-01-09 03:57:42,236 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 118 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:42,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1204 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:42,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121018 states. [2025-01-09 03:57:45,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121018 to 121010. [2025-01-09 03:57:45,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121010 states, 102373 states have (on average 1.6230842116573705) internal successors, (166160), 102380 states have internal predecessors, (166160), 18609 states have call successors, (18609), 24 states have call predecessors, (18609), 27 states have return successors, (20800), 18607 states have call predecessors, (20800), 18608 states have call successors, (20800) [2025-01-09 03:57:46,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121010 states to 121010 states and 205569 transitions. [2025-01-09 03:57:46,412 INFO L78 Accepts]: Start accepts. Automaton has 121010 states and 205569 transitions. Word has length 126 [2025-01-09 03:57:46,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:46,416 INFO L471 AbstractCegarLoop]: Abstraction has 121010 states and 205569 transitions. [2025-01-09 03:57:46,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand 121010 states and 205569 transitions. [2025-01-09 03:57:46,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 03:57:46,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:46,487 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:46,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:57:46,488 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:46,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:46,491 INFO L85 PathProgramCache]: Analyzing trace with hash -590311625, now seen corresponding path program 1 times [2025-01-09 03:57:46,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:46,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291851128] [2025-01-09 03:57:46,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:46,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:46,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:57:46,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:57:46,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:46,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:46,844 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:46,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:46,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291851128] [2025-01-09 03:57:46,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291851128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:46,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:46,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 03:57:46,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155833809] [2025-01-09 03:57:46,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:46,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 03:57:46,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:46,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 03:57:46,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:57:46,847 INFO L87 Difference]: Start difference. First operand 121010 states and 205569 transitions. Second operand has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 03:57:52,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:52,676 INFO L93 Difference]: Finished difference Result 241116 states and 415078 transitions. [2025-01-09 03:57:52,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 03:57:52,676 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 127 [2025-01-09 03:57:52,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:53,892 INFO L225 Difference]: With dead ends: 241116 [2025-01-09 03:57:53,893 INFO L226 Difference]: Without dead ends: 240926 [2025-01-09 03:57:53,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2025-01-09 03:57:53,994 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 1542 mSDsluCounter, 6044 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 6767 SdHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:53,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 6767 Invalid, 1667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 03:57:54,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240926 states.