./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec6_product14.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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_spec6_product14.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 bcfdffd5743ab46e6f5628bffe82029f1c91fa1aa61e5033c157235a6e9c82be --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:46:13,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:46:13,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:46:13,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:46:13,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:46:13,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:46:13,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:46:13,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:46:13,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:46:13,174 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:46:13,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:46:13,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:46:13,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:46:13,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:46:13,175 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:46:13,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:46:13,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:46:13,176 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:46:13,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:46:13,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:46:13,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:46:13,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:46:13,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:46:13,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:46:13,177 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:46:13,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:46:13,177 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:46:13,177 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:46:13,177 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:46:13,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:46:13,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:46:13,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:46:13,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:46:13,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:46:13,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:46:13,178 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:46:13,178 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:46:13,178 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:46:13,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:46:13,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:46:13,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:46:13,179 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:46:13,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:46:13,179 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 -> bcfdffd5743ab46e6f5628bffe82029f1c91fa1aa61e5033c157235a6e9c82be [2025-02-05 15:46:13,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:46:13,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:46:13,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:46:13,478 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:46:13,478 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:46:13,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec6_product14.cil.c [2025-02-05 15:46:14,804 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/928ddd47c/51d54a18c5e8498885c26ba0f4d46f31/FLAG26254860f [2025-02-05 15:46:15,190 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:46:15,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product14.cil.c [2025-02-05 15:46:15,218 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/928ddd47c/51d54a18c5e8498885c26ba0f4d46f31/FLAG26254860f [2025-02-05 15:46:15,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/928ddd47c/51d54a18c5e8498885c26ba0f4d46f31 [2025-02-05 15:46:15,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:46:15,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:46:15,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:46:15,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:46:15,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:46:15,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:46:15" (1/1) ... [2025-02-05 15:46:15,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c7fe49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:15, skipping insertion in model container [2025-02-05 15:46:15,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:46:15" (1/1) ... [2025-02-05 15:46:15,316 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:46:15,707 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_spec6_product14.cil.c[43937,43950] [2025-02-05 15:46:15,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:46:15,879 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:46:15,890 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-02-05 15:46:15,891 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptDecrypt_spec.i","") [368] [2025-02-05 15:46:15,891 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [419] [2025-02-05 15:46:15,891 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1488] [2025-02-05 15:46:15,891 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1523] [2025-02-05 15:46:15,892 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1803] [2025-02-05 15:46:15,892 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2019] [2025-02-05 15:46:15,892 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2036] [2025-02-05 15:46:15,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2045] [2025-02-05 15:46:15,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2151] [2025-02-05 15:46:15,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2517] [2025-02-05 15:46:15,961 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_spec6_product14.cil.c[43937,43950] [2025-02-05 15:46:15,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:46:16,027 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:46:16,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:16 WrapperNode [2025-02-05 15:46:16,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:46:16,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:46:16,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:46:16,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:46:16,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:16" (1/1) ... [2025-02-05 15:46:16,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:16" (1/1) ... [2025-02-05 15:46:16,095 INFO L138 Inliner]: procedures = 126, calls = 194, calls flagged for inlining = 49, calls inlined = 41, statements flattened = 875 [2025-02-05 15:46:16,096 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:46:16,096 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:46:16,096 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:46:16,097 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:46:16,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:16" (1/1) ... [2025-02-05 15:46:16,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:16" (1/1) ... [2025-02-05 15:46:16,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:16" (1/1) ... [2025-02-05 15:46:16,137 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-02-05 15:46:16,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:16" (1/1) ... [2025-02-05 15:46:16,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:16" (1/1) ... [2025-02-05 15:46:16,162 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:16" (1/1) ... [2025-02-05 15:46:16,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:16" (1/1) ... [2025-02-05 15:46:16,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:16" (1/1) ... [2025-02-05 15:46:16,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:16" (1/1) ... [2025-02-05 15:46:16,191 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:46:16,195 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:46:16,195 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:46:16,195 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:46:16,196 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:16" (1/1) ... [2025-02-05 15:46:16,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:46:16,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:16,226 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-02-05 15:46:16,233 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-02-05 15:46:16,250 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:46:16,250 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:46:16,250 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:46:16,251 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:46:16,251 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:46:16,251 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:46:16,251 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:46:16,251 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:46:16,251 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:46:16,252 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:46:16,252 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:46:16,252 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:46:16,252 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:46:16,252 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:46:16,252 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:46:16,252 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:46:16,252 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:46:16,252 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:46:16,252 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:46:16,252 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:46:16,252 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:46:16,252 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:46:16,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:46:16,252 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:46:16,252 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:46:16,252 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:46:16,252 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:46:16,253 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:46:16,253 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:46:16,253 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:46:16,253 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:46:16,253 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:46:16,253 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:46:16,253 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2025-02-05 15:46:16,253 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2025-02-05 15:46:16,253 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:46:16,253 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:46:16,253 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:46:16,253 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:46:16,253 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:46:16,253 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:46:16,253 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:46:16,253 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:46:16,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:46:16,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:46:16,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:46:16,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:46:16,253 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:46:16,253 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:46:16,253 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:46:16,253 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:46:16,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:46:16,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:46:16,469 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:46:16,471 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:46:16,567 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1783: #res := ~retValue_acc~24; [2025-02-05 15:46:16,620 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1077-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~11#1; [2025-02-05 15:46:16,621 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1122: #res#1 := ~retValue_acc~12#1; [2025-02-05 15:46:16,793 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1465-1: getClientId_#res#1 := getClientId_~retValue_acc~17#1; [2025-02-05 15:46:16,793 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1346-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~15#1; [2025-02-05 15:46:16,808 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030: #res := ~retValue_acc~10; [2025-02-05 15:46:16,829 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2148-1: createEmail_#res#1 := createEmail_~retValue_acc~29#1; [2025-02-05 15:46:16,845 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L574: #res := ~retValue_acc~4; [2025-02-05 15:46:16,866 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2753: #res := ~retValue_acc~39; [2025-02-05 15:46:16,918 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2790: #res := ~retValue_acc~40; [2025-02-05 15:46:16,955 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2638: #res := ~retValue_acc~36; [2025-02-05 15:46:17,012 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L900: #res := ~retValue_acc~8; [2025-02-05 15:46:17,360 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1292-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~14#1; [2025-02-05 15:46:17,360 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1185-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~13#1; [2025-02-05 15:46:17,361 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1740-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~21#1; [2025-02-05 15:46:17,361 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1749-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~22#1; [2025-02-05 15:46:17,361 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1758-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~23#1; [2025-02-05 15:46:17,362 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1520-1: valid_product_#res#1 := valid_product_~retValue_acc~19#1; [2025-02-05 15:46:17,486 INFO L? ?]: Removed 438 outVars from TransFormulas that were not future-live. [2025-02-05 15:46:17,487 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:46:17,509 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:46:17,513 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:46:17,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:46:17 BoogieIcfgContainer [2025-02-05 15:46:17,513 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:46:17,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:46:17,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:46:17,520 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:46:17,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:46:15" (1/3) ... [2025-02-05 15:46:17,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22957e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:46:17, skipping insertion in model container [2025-02-05 15:46:17,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:16" (2/3) ... [2025-02-05 15:46:17,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22957e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:46:17, skipping insertion in model container [2025-02-05 15:46:17,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:46:17" (3/3) ... [2025-02-05 15:46:17,522 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec6_product14.cil.c [2025-02-05 15:46:17,535 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:46:17,539 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec6_product14.cil.c that has 24 procedures, 354 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:46:17,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:46:17,620 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;@70e4d156, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:46:17,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:46:17,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 354 states, 273 states have (on average 1.5714285714285714) internal successors, (429), 278 states have internal predecessors, (429), 56 states have call successors, (56), 23 states have call predecessors, (56), 23 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-05 15:46:17,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:46:17,643 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:17,643 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:17,644 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:17,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:17,647 INFO L85 PathProgramCache]: Analyzing trace with hash 762497556, now seen corresponding path program 1 times [2025-02-05 15:46:17,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:17,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608613075] [2025-02-05 15:46:17,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:17,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:17,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:46:17,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:46:17,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:17,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:46:18,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:18,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608613075] [2025-02-05 15:46:18,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608613075] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:18,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014961527] [2025-02-05 15:46:18,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:18,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:18,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:18,499 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-02-05 15:46:18,501 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-02-05 15:46:18,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:46:18,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:46:18,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:18,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:18,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:46:18,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:18,903 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:46:18,904 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:18,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014961527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:18,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:18,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:46:18,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548660275] [2025-02-05 15:46:18,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:18,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:46:18,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:18,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:46:18,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:18,935 INFO L87 Difference]: Start difference. First operand has 354 states, 273 states have (on average 1.5714285714285714) internal successors, (429), 278 states have internal predecessors, (429), 56 states have call successors, (56), 23 states have call predecessors, (56), 23 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:18,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:19,000 INFO L93 Difference]: Finished difference Result 521 states and 782 transitions. [2025-02-05 15:46:19,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:46:19,005 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 123 [2025-02-05 15:46:19,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:19,022 INFO L225 Difference]: With dead ends: 521 [2025-02-05 15:46:19,023 INFO L226 Difference]: Without dead ends: 347 [2025-02-05 15:46:19,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 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-02-05 15:46:19,033 INFO L435 NwaCegarLoop]: 538 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, 538 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-02-05 15:46:19,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:19,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-02-05 15:46:19,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2025-02-05 15:46:19,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 267 states have (on average 1.5692883895131087) internal successors, (419), 271 states have internal predecessors, (419), 56 states have call successors, (56), 23 states have call predecessors, (56), 23 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-02-05 15:46:19,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 530 transitions. [2025-02-05 15:46:19,121 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 530 transitions. Word has length 123 [2025-02-05 15:46:19,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:19,123 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 530 transitions. [2025-02-05 15:46:19,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:19,123 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 530 transitions. [2025-02-05 15:46:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 15:46:19,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:19,134 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:19,144 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-02-05 15:46:19,335 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-02-05 15:46:19,335 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:19,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:19,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1560009364, now seen corresponding path program 1 times [2025-02-05 15:46:19,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:19,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966064075] [2025-02-05 15:46:19,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:19,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:19,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 15:46:19,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 15:46:19,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:19,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:46:19,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:19,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966064075] [2025-02-05 15:46:19,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966064075] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:19,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727968587] [2025-02-05 15:46:19,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:19,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:19,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:19,714 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-02-05 15:46:19,717 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-02-05 15:46:19,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 15:46:20,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 15:46:20,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:20,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:20,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 1143 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:46:20,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-05 15:46:20,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:20,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727968587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:20,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:20,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:46:20,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106882917] [2025-02-05 15:46:20,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:20,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:20,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:20,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:20,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:46:20,117 INFO L87 Difference]: Start difference. First operand 347 states and 530 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:20,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:20,167 INFO L93 Difference]: Finished difference Result 510 states and 760 transitions. [2025-02-05 15:46:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:20,167 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 143 [2025-02-05 15:46:20,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:20,172 INFO L225 Difference]: With dead ends: 510 [2025-02-05 15:46:20,173 INFO L226 Difference]: Without dead ends: 349 [2025-02-05 15:46:20,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 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-02-05 15:46:20,175 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 0 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:20,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1056 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:20,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-02-05 15:46:20,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2025-02-05 15:46:20,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 269 states have (on average 1.5650557620817844) internal successors, (421), 273 states have internal predecessors, (421), 56 states have call successors, (56), 23 states have call predecessors, (56), 23 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-02-05 15:46:20,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 532 transitions. [2025-02-05 15:46:20,213 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 532 transitions. Word has length 143 [2025-02-05 15:46:20,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:20,215 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 532 transitions. [2025-02-05 15:46:20,215 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:20,216 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 532 transitions. [2025-02-05 15:46:20,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 15:46:20,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:20,219 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:20,229 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-02-05 15:46:20,419 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-02-05 15:46:20,420 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:20,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:20,420 INFO L85 PathProgramCache]: Analyzing trace with hash 298047295, now seen corresponding path program 1 times [2025-02-05 15:46:20,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:20,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786658313] [2025-02-05 15:46:20,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:20,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:20,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:46:20,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:46:20,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:20,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:20,659 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:46:20,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:20,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786658313] [2025-02-05 15:46:20,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786658313] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:20,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871928489] [2025-02-05 15:46:20,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:20,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:20,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:20,664 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-02-05 15:46:20,666 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-02-05 15:46:20,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:46:20,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:46:20,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:20,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:20,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 1077 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:46:20,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:46:21,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:21,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871928489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:21,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:21,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:46:21,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904191520] [2025-02-05 15:46:21,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:21,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:21,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:21,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:21,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:46:21,033 INFO L87 Difference]: Start difference. First operand 349 states and 532 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:21,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:21,086 INFO L93 Difference]: Finished difference Result 740 states and 1147 transitions. [2025-02-05 15:46:21,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:21,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2025-02-05 15:46:21,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:21,094 INFO L225 Difference]: With dead ends: 740 [2025-02-05 15:46:21,094 INFO L226 Difference]: Without dead ends: 418 [2025-02-05 15:46:21,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 129 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-02-05 15:46:21,098 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 126 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1019 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-02-05 15:46:21,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1019 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:21,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-02-05 15:46:21,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 410. [2025-02-05 15:46:21,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 316 states have (on average 1.5854430379746836) internal successors, (501), 320 states have internal predecessors, (501), 70 states have call successors, (70), 23 states have call predecessors, (70), 23 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-05 15:46:21,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 640 transitions. [2025-02-05 15:46:21,135 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 640 transitions. Word has length 129 [2025-02-05 15:46:21,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:21,135 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 640 transitions. [2025-02-05 15:46:21,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 640 transitions. [2025-02-05 15:46:21,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 15:46:21,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:21,141 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:21,151 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-02-05 15:46:21,346 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-02-05 15:46:21,346 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:21,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:21,347 INFO L85 PathProgramCache]: Analyzing trace with hash 11033447, now seen corresponding path program 1 times [2025-02-05 15:46:21,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:21,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666562615] [2025-02-05 15:46:21,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:21,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:21,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:46:21,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:46:21,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:21,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:21,609 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 15:46:21,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:21,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666562615] [2025-02-05 15:46:21,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666562615] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:21,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233657446] [2025-02-05 15:46:21,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:21,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:21,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:21,613 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-02-05 15:46:21,616 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-02-05 15:46:21,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:46:21,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:46:21,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:21,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:21,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:46:21,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 15:46:22,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:22,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233657446] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:22,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:22,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:46:22,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057344334] [2025-02-05 15:46:22,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:22,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:22,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:22,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:22,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:46:22,068 INFO L87 Difference]: Start difference. First operand 410 states and 640 transitions. Second operand has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:46:22,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:22,161 INFO L93 Difference]: Finished difference Result 811 states and 1270 transitions. [2025-02-05 15:46:22,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:22,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 149 [2025-02-05 15:46:22,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:22,168 INFO L225 Difference]: With dead ends: 811 [2025-02-05 15:46:22,168 INFO L226 Difference]: Without dead ends: 412 [2025-02-05 15:46:22,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 147 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-02-05 15:46:22,172 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 2 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2077 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-02-05 15:46:22,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2077 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:22,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-02-05 15:46:22,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2025-02-05 15:46:22,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 317 states have (on average 1.583596214511041) internal successors, (502), 322 states have internal predecessors, (502), 70 states have call successors, (70), 23 states have call predecessors, (70), 24 states have return successors, (71), 68 states have call predecessors, (71), 69 states have call successors, (71) [2025-02-05 15:46:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 643 transitions. [2025-02-05 15:46:22,198 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 643 transitions. Word has length 149 [2025-02-05 15:46:22,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:22,198 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 643 transitions. [2025-02-05 15:46:22,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:46:22,198 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 643 transitions. [2025-02-05 15:46:22,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 15:46:22,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:22,202 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:22,212 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-02-05 15:46:22,402 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-02-05 15:46:22,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:22,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:22,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1169541608, now seen corresponding path program 1 times [2025-02-05 15:46:22,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:22,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546000930] [2025-02-05 15:46:22,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:22,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:22,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 15:46:22,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 15:46:22,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:22,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:22,643 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:22,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:22,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546000930] [2025-02-05 15:46:22,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546000930] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:22,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433192677] [2025-02-05 15:46:22,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:22,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:22,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:22,647 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-02-05 15:46:22,649 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-02-05 15:46:22,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 15:46:22,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 15:46:22,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:22,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:22,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:46:22,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:22,994 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 15:46:22,995 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:22,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433192677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:22,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:22,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:46:22,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090239324] [2025-02-05 15:46:22,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:22,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:22,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:22,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:22,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:46:22,996 INFO L87 Difference]: Start difference. First operand 412 states and 643 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:46:23,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:23,077 INFO L93 Difference]: Finished difference Result 813 states and 1275 transitions. [2025-02-05 15:46:23,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:23,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 150 [2025-02-05 15:46:23,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:23,085 INFO L225 Difference]: With dead ends: 813 [2025-02-05 15:46:23,085 INFO L226 Difference]: Without dead ends: 414 [2025-02-05 15:46:23,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 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-02-05 15:46:23,088 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 2 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2063 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-02-05 15:46:23,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2063 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:23,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-02-05 15:46:23,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2025-02-05 15:46:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 318 states have (on average 1.5817610062893082) internal successors, (503), 324 states have internal predecessors, (503), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (76), 68 states have call predecessors, (76), 69 states have call successors, (76) [2025-02-05 15:46:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 649 transitions. [2025-02-05 15:46:23,108 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 649 transitions. Word has length 150 [2025-02-05 15:46:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:23,108 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 649 transitions. [2025-02-05 15:46:23,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:46:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 649 transitions. [2025-02-05 15:46:23,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:46:23,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:23,111 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:23,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:46:23,312 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-02-05 15:46:23,312 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:23,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:23,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1427285737, now seen corresponding path program 1 times [2025-02-05 15:46:23,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:23,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649030338] [2025-02-05 15:46:23,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:23,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:23,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:46:23,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:46:23,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:23,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:46:23,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:23,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649030338] [2025-02-05 15:46:23,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649030338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:23,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:23,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:46:23,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832342901] [2025-02-05 15:46:23,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:23,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:23,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:23,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:23,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:23,484 INFO L87 Difference]: Start difference. First operand 414 states and 649 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:46:23,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:23,532 INFO L93 Difference]: Finished difference Result 805 states and 1266 transitions. [2025-02-05 15:46:23,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:23,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 132 [2025-02-05 15:46:23,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:23,536 INFO L225 Difference]: With dead ends: 805 [2025-02-05 15:46:23,536 INFO L226 Difference]: Without dead ends: 414 [2025-02-05 15:46:23,538 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-02-05 15:46:23,539 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 2 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2081 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-02-05 15:46:23,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2081 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:23,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-02-05 15:46:23,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2025-02-05 15:46:23,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 318 states have (on average 1.5817610062893082) internal successors, (503), 324 states have internal predecessors, (503), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (75), 68 states have call predecessors, (75), 69 states have call successors, (75) [2025-02-05 15:46:23,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 648 transitions. [2025-02-05 15:46:23,558 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 648 transitions. Word has length 132 [2025-02-05 15:46:23,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:23,559 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 648 transitions. [2025-02-05 15:46:23,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:46:23,559 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 648 transitions. [2025-02-05 15:46:23,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:46:23,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:23,562 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:23,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:46:23,563 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:23,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:23,563 INFO L85 PathProgramCache]: Analyzing trace with hash -534889546, now seen corresponding path program 2 times [2025-02-05 15:46:23,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:23,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059732464] [2025-02-05 15:46:23,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:46:23,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:23,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 133 statements into 2 equivalence classes. [2025-02-05 15:46:23,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:46:23,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:46:23,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:23,737 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 15:46:23,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:23,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059732464] [2025-02-05 15:46:23,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059732464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:23,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:23,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:46:23,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101139648] [2025-02-05 15:46:23,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:23,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:23,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:23,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:23,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:23,740 INFO L87 Difference]: Start difference. First operand 414 states and 648 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:46:23,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:23,794 INFO L93 Difference]: Finished difference Result 803 states and 1261 transitions. [2025-02-05 15:46:23,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:23,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 133 [2025-02-05 15:46:23,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:23,798 INFO L225 Difference]: With dead ends: 803 [2025-02-05 15:46:23,798 INFO L226 Difference]: Without dead ends: 414 [2025-02-05 15:46:23,800 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-02-05 15:46:23,800 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 2 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2067 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-02-05 15:46:23,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2067 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:23,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-02-05 15:46:23,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2025-02-05 15:46:23,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 318 states have (on average 1.5817610062893082) internal successors, (503), 324 states have internal predecessors, (503), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (74), 68 states have call predecessors, (74), 69 states have call successors, (74) [2025-02-05 15:46:23,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 647 transitions. [2025-02-05 15:46:23,824 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 647 transitions. Word has length 133 [2025-02-05 15:46:23,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:23,824 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 647 transitions. [2025-02-05 15:46:23,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:46:23,824 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 647 transitions. [2025-02-05 15:46:23,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 15:46:23,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:23,827 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:23,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:46:23,828 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:23,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:23,829 INFO L85 PathProgramCache]: Analyzing trace with hash -528630838, now seen corresponding path program 3 times [2025-02-05 15:46:23,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:23,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850251852] [2025-02-05 15:46:23,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:46:23,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:23,853 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 3 equivalence classes. [2025-02-05 15:46:23,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 122 of 134 statements. [2025-02-05 15:46:23,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:46:23,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 15:46:23,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:23,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850251852] [2025-02-05 15:46:23,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850251852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:23,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:23,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:46:23,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874544814] [2025-02-05 15:46:23,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:23,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:23,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:23,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:23,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:23,973 INFO L87 Difference]: Start difference. First operand 414 states and 647 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:46:24,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:24,039 INFO L93 Difference]: Finished difference Result 805 states and 1267 transitions. [2025-02-05 15:46:24,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:24,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 134 [2025-02-05 15:46:24,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:24,043 INFO L225 Difference]: With dead ends: 805 [2025-02-05 15:46:24,043 INFO L226 Difference]: Without dead ends: 416 [2025-02-05 15:46:24,047 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-02-05 15:46:24,048 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 1 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2078 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-02-05 15:46:24,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2078 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:24,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-02-05 15:46:24,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2025-02-05 15:46:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 319 states have (on average 1.5799373040752351) internal successors, (504), 326 states have internal predecessors, (504), 70 states have call successors, (70), 23 states have call predecessors, (70), 26 states have return successors, (79), 68 states have call predecessors, (79), 69 states have call successors, (79) [2025-02-05 15:46:24,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 653 transitions. [2025-02-05 15:46:24,076 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 653 transitions. Word has length 134 [2025-02-05 15:46:24,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:24,077 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 653 transitions. [2025-02-05 15:46:24,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:46:24,077 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 653 transitions. [2025-02-05 15:46:24,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:46:24,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:24,080 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:24,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:46:24,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:24,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:24,081 INFO L85 PathProgramCache]: Analyzing trace with hash 534647955, now seen corresponding path program 1 times [2025-02-05 15:46:24,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:24,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323265302] [2025-02-05 15:46:24,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:24,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:24,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:46:24,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:46:24,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:24,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 15:46:24,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:24,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323265302] [2025-02-05 15:46:24,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323265302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:24,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:24,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:46:24,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521278783] [2025-02-05 15:46:24,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:24,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:24,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:24,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:24,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:24,230 INFO L87 Difference]: Start difference. First operand 416 states and 653 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:46:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:24,278 INFO L93 Difference]: Finished difference Result 811 states and 1277 transitions. [2025-02-05 15:46:24,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:24,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 135 [2025-02-05 15:46:24,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:24,282 INFO L225 Difference]: With dead ends: 811 [2025-02-05 15:46:24,282 INFO L226 Difference]: Without dead ends: 418 [2025-02-05 15:46:24,284 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-02-05 15:46:24,285 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 1 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2084 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-02-05 15:46:24,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2084 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:24,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-02-05 15:46:24,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-02-05 15:46:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 320 states have (on average 1.578125) internal successors, (505), 328 states have internal predecessors, (505), 70 states have call successors, (70), 23 states have call predecessors, (70), 27 states have return successors, (81), 68 states have call predecessors, (81), 69 states have call successors, (81) [2025-02-05 15:46:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 656 transitions. [2025-02-05 15:46:24,306 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 656 transitions. Word has length 135 [2025-02-05 15:46:24,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:24,307 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 656 transitions. [2025-02-05 15:46:24,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:46:24,308 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 656 transitions. [2025-02-05 15:46:24,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 15:46:24,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:24,310 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:24,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:46:24,311 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:24,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:24,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1546786696, now seen corresponding path program 1 times [2025-02-05 15:46:24,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:24,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484792994] [2025-02-05 15:46:24,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:24,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:24,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 15:46:24,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 15:46:24,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:24,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:46:24,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:24,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484792994] [2025-02-05 15:46:24,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484792994] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:24,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128647998] [2025-02-05 15:46:24,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:24,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:24,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:24,491 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-02-05 15:46:24,493 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-02-05 15:46:24,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 15:46:24,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 15:46:24,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:24,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:24,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 1166 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:46:24,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:24,832 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:46:24,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:46:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:46:24,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128647998] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:46:24,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:46:24,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 15:46:24,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952396247] [2025-02-05 15:46:24,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:46:24,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:46:24,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:24,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:46:24,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:46:24,952 INFO L87 Difference]: Start difference. First operand 418 states and 656 transitions. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 15:46:25,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:25,123 INFO L93 Difference]: Finished difference Result 991 states and 1612 transitions. [2025-02-05 15:46:25,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:46:25,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 155 [2025-02-05 15:46:25,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:25,130 INFO L225 Difference]: With dead ends: 991 [2025-02-05 15:46:25,131 INFO L226 Difference]: Without dead ends: 830 [2025-02-05 15:46:25,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:46:25,133 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 599 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:25,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1513 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:46:25,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2025-02-05 15:46:25,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 806. [2025-02-05 15:46:25,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 629 states have (on average 1.6422893481717011) internal successors, (1033), 637 states have internal predecessors, (1033), 149 states have call successors, (149), 23 states have call predecessors, (149), 27 states have return successors, (170), 147 states have call predecessors, (170), 148 states have call successors, (170) [2025-02-05 15:46:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1352 transitions. [2025-02-05 15:46:25,175 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1352 transitions. Word has length 155 [2025-02-05 15:46:25,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:25,176 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1352 transitions. [2025-02-05 15:46:25,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 15:46:25,176 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1352 transitions. [2025-02-05 15:46:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 15:46:25,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:25,183 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:25,194 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-02-05 15:46:25,383 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-02-05 15:46:25,384 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:25,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:25,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1850588797, now seen corresponding path program 1 times [2025-02-05 15:46:25,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:25,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185955719] [2025-02-05 15:46:25,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:25,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:25,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:46:25,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:46:25,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:25,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:25,458 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:25,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:25,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185955719] [2025-02-05 15:46:25,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185955719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:25,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:25,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:25,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798691957] [2025-02-05 15:46:25,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:25,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:25,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:25,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:25,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:25,461 INFO L87 Difference]: Start difference. First operand 806 states and 1352 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:25,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:25,514 INFO L93 Difference]: Finished difference Result 1939 states and 3298 transitions. [2025-02-05 15:46:25,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:25,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2025-02-05 15:46:25,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:25,525 INFO L225 Difference]: With dead ends: 1939 [2025-02-05 15:46:25,525 INFO L226 Difference]: Without dead ends: 1199 [2025-02-05 15:46:25,529 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-02-05 15:46:25,529 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 124 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1079 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-02-05 15:46:25,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1079 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:25,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2025-02-05 15:46:25,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1191. [2025-02-05 15:46:25,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 935 states have (on average 1.655614973262032) internal successors, (1548), 943 states have internal predecessors, (1548), 228 states have call successors, (228), 23 states have call predecessors, (228), 27 states have return successors, (259), 226 states have call predecessors, (259), 227 states have call successors, (259) [2025-02-05 15:46:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 2035 transitions. [2025-02-05 15:46:25,592 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 2035 transitions. Word has length 142 [2025-02-05 15:46:25,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:25,592 INFO L471 AbstractCegarLoop]: Abstraction has 1191 states and 2035 transitions. [2025-02-05 15:46:25,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:25,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 2035 transitions. [2025-02-05 15:46:25,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 15:46:25,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:25,602 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:25,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:46:25,602 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:25,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:25,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2066993068, now seen corresponding path program 1 times [2025-02-05 15:46:25,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:25,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707750498] [2025-02-05 15:46:25,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:25,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:25,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 15:46:25,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 15:46:25,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:25,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:46:25,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:25,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707750498] [2025-02-05 15:46:25,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707750498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:25,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:25,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:25,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766520820] [2025-02-05 15:46:25,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:25,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:25,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:25,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:25,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:25,694 INFO L87 Difference]: Start difference. First operand 1191 states and 2035 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:25,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:25,810 INFO L93 Difference]: Finished difference Result 2877 states and 4945 transitions. [2025-02-05 15:46:25,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:25,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 162 [2025-02-05 15:46:25,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:25,826 INFO L225 Difference]: With dead ends: 2877 [2025-02-05 15:46:25,826 INFO L226 Difference]: Without dead ends: 1803 [2025-02-05 15:46:25,831 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-02-05 15:46:25,833 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 122 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1052 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-02-05 15:46:25,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1052 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:25,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2025-02-05 15:46:25,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1795. [2025-02-05 15:46:25,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1420 states have (on average 1.6640845070422534) internal successors, (2363), 1428 states have internal predecessors, (2363), 347 states have call successors, (347), 23 states have call predecessors, (347), 27 states have return successors, (378), 345 states have call predecessors, (378), 346 states have call successors, (378) [2025-02-05 15:46:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 3088 transitions. [2025-02-05 15:46:25,932 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 3088 transitions. Word has length 162 [2025-02-05 15:46:25,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:25,934 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 3088 transitions. [2025-02-05 15:46:25,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:25,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 3088 transitions. [2025-02-05 15:46:25,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 15:46:25,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:25,948 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:25,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:46:25,949 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:25,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:25,950 INFO L85 PathProgramCache]: Analyzing trace with hash 971710244, now seen corresponding path program 1 times [2025-02-05 15:46:25,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:25,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565573651] [2025-02-05 15:46:25,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:25,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:25,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 15:46:25,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 15:46:25,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:25,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:26,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:26,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565573651] [2025-02-05 15:46:26,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565573651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:26,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:26,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:26,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013544440] [2025-02-05 15:46:26,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:26,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:26,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:26,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:26,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:26,029 INFO L87 Difference]: Start difference. First operand 1795 states and 3088 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:26,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:26,134 INFO L93 Difference]: Finished difference Result 4284 states and 7427 transitions. [2025-02-05 15:46:26,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:26,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2025-02-05 15:46:26,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:26,153 INFO L225 Difference]: With dead ends: 4284 [2025-02-05 15:46:26,153 INFO L226 Difference]: Without dead ends: 2728 [2025-02-05 15:46:26,161 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-02-05 15:46:26,162 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 120 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1049 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-02-05 15:46:26,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1049 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:26,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2025-02-05 15:46:26,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 2720. [2025-02-05 15:46:26,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2720 states, 2183 states have (on average 1.6710948236371965) internal successors, (3648), 2191 states have internal predecessors, (3648), 509 states have call successors, (509), 23 states have call predecessors, (509), 27 states have return successors, (556), 507 states have call predecessors, (556), 508 states have call successors, (556) [2025-02-05 15:46:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2720 states and 4713 transitions. [2025-02-05 15:46:26,333 INFO L78 Accepts]: Start accepts. Automaton has 2720 states and 4713 transitions. Word has length 144 [2025-02-05 15:46:26,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:26,334 INFO L471 AbstractCegarLoop]: Abstraction has 2720 states and 4713 transitions. [2025-02-05 15:46:26,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:26,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 4713 transitions. [2025-02-05 15:46:26,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 15:46:26,353 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:26,354 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:26,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:46:26,354 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:26,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:26,354 INFO L85 PathProgramCache]: Analyzing trace with hash -789457634, now seen corresponding path program 1 times [2025-02-05 15:46:26,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:26,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823264311] [2025-02-05 15:46:26,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:26,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:26,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 15:46:26,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 15:46:26,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:26,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:26,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:26,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823264311] [2025-02-05 15:46:26,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823264311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:26,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:26,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:26,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234332269] [2025-02-05 15:46:26,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:26,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:26,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:26,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:26,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:26,451 INFO L87 Difference]: Start difference. First operand 2720 states and 4713 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:26,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:26,640 INFO L93 Difference]: Finished difference Result 6502 states and 11348 transitions. [2025-02-05 15:46:26,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:26,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2025-02-05 15:46:26,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:26,673 INFO L225 Difference]: With dead ends: 6502 [2025-02-05 15:46:26,673 INFO L226 Difference]: Without dead ends: 4221 [2025-02-05 15:46:26,686 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-02-05 15:46:26,687 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 118 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1049 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-02-05 15:46:26,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1049 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:26,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4221 states. [2025-02-05 15:46:26,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4221 to 4213. [2025-02-05 15:46:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4213 states, 3431 states have (on average 1.6761877003788983) internal successors, (5751), 3439 states have internal predecessors, (5751), 754 states have call successors, (754), 23 states have call predecessors, (754), 27 states have return successors, (827), 752 states have call predecessors, (827), 753 states have call successors, (827) [2025-02-05 15:46:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4213 states to 4213 states and 7332 transitions. [2025-02-05 15:46:26,938 INFO L78 Accepts]: Start accepts. Automaton has 4213 states and 7332 transitions. Word has length 145 [2025-02-05 15:46:26,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:26,939 INFO L471 AbstractCegarLoop]: Abstraction has 4213 states and 7332 transitions. [2025-02-05 15:46:26,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:26,939 INFO L276 IsEmpty]: Start isEmpty. Operand 4213 states and 7332 transitions. [2025-02-05 15:46:26,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 15:46:26,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:26,967 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:26,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:46:26,967 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:26,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:26,968 INFO L85 PathProgramCache]: Analyzing trace with hash 479178661, now seen corresponding path program 1 times [2025-02-05 15:46:26,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:26,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492486449] [2025-02-05 15:46:26,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:26,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:26,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 15:46:26,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 15:46:26,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:26,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:27,043 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:27,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:27,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492486449] [2025-02-05 15:46:27,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492486449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:27,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:27,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:27,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360244503] [2025-02-05 15:46:27,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:27,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:27,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:27,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:27,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:27,045 INFO L87 Difference]: Start difference. First operand 4213 states and 7332 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:27,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:27,271 INFO L93 Difference]: Finished difference Result 10462 states and 18304 transitions. [2025-02-05 15:46:27,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:27,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 146 [2025-02-05 15:46:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:27,319 INFO L225 Difference]: With dead ends: 10462 [2025-02-05 15:46:27,319 INFO L226 Difference]: Without dead ends: 6915 [2025-02-05 15:46:27,336 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-02-05 15:46:27,337 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 116 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1072 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-02-05 15:46:27,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1072 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:27,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6915 states. [2025-02-05 15:46:27,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6915 to 6907. [2025-02-05 15:46:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6907 states, 5632 states have (on average 1.6720525568181819) internal successors, (9417), 5640 states have internal predecessors, (9417), 1247 states have call successors, (1247), 23 states have call predecessors, (1247), 27 states have return successors, (1364), 1245 states have call predecessors, (1364), 1246 states have call successors, (1364) [2025-02-05 15:46:27,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6907 states to 6907 states and 12028 transitions. [2025-02-05 15:46:27,787 INFO L78 Accepts]: Start accepts. Automaton has 6907 states and 12028 transitions. Word has length 146 [2025-02-05 15:46:27,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:27,787 INFO L471 AbstractCegarLoop]: Abstraction has 6907 states and 12028 transitions. [2025-02-05 15:46:27,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:27,788 INFO L276 IsEmpty]: Start isEmpty. Operand 6907 states and 12028 transitions. [2025-02-05 15:46:27,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 15:46:27,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:27,825 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:27,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:46:27,826 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:27,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:27,826 INFO L85 PathProgramCache]: Analyzing trace with hash -307795794, now seen corresponding path program 1 times [2025-02-05 15:46:27,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:27,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864509608] [2025-02-05 15:46:27,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:27,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:27,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 15:46:27,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 15:46:27,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:27,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:27,904 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:46:27,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:27,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864509608] [2025-02-05 15:46:27,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864509608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:27,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:27,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:27,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662180327] [2025-02-05 15:46:27,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:27,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:27,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:27,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:27,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:27,907 INFO L87 Difference]: Start difference. First operand 6907 states and 12028 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:28,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:28,261 INFO L93 Difference]: Finished difference Result 17497 states and 30660 transitions. [2025-02-05 15:46:28,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:28,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 166 [2025-02-05 15:46:28,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:28,330 INFO L225 Difference]: With dead ends: 17497 [2025-02-05 15:46:28,330 INFO L226 Difference]: Without dead ends: 11627 [2025-02-05 15:46:28,355 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-02-05 15:46:28,356 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 114 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1060 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-02-05 15:46:28,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1060 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:28,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11627 states. [2025-02-05 15:46:28,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11627 to 11619. [2025-02-05 15:46:28,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11619 states, 9522 states have (on average 1.6722327242176014) internal successors, (15923), 9530 states have internal predecessors, (15923), 2069 states have call successors, (2069), 23 states have call predecessors, (2069), 27 states have return successors, (2264), 2067 states have call predecessors, (2264), 2068 states have call successors, (2264) [2025-02-05 15:46:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11619 states to 11619 states and 20256 transitions. [2025-02-05 15:46:28,974 INFO L78 Accepts]: Start accepts. Automaton has 11619 states and 20256 transitions. Word has length 166 [2025-02-05 15:46:28,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:28,974 INFO L471 AbstractCegarLoop]: Abstraction has 11619 states and 20256 transitions. [2025-02-05 15:46:28,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand 11619 states and 20256 transitions. [2025-02-05 15:46:29,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 15:46:29,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:29,027 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:29,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:46:29,027 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:29,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:29,028 INFO L85 PathProgramCache]: Analyzing trace with hash -978643834, now seen corresponding path program 1 times [2025-02-05 15:46:29,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:29,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415693881] [2025-02-05 15:46:29,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:29,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:29,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:46:29,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:46:29,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:29,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:29,118 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:29,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:29,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415693881] [2025-02-05 15:46:29,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415693881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:29,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:29,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:29,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081614547] [2025-02-05 15:46:29,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:29,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:29,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:29,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:29,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:29,120 INFO L87 Difference]: Start difference. First operand 11619 states and 20256 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:29,747 INFO L93 Difference]: Finished difference Result 27728 states and 48302 transitions. [2025-02-05 15:46:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:29,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 148 [2025-02-05 15:46:29,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:29,927 INFO L225 Difference]: With dead ends: 27728 [2025-02-05 15:46:29,927 INFO L226 Difference]: Without dead ends: 18083 [2025-02-05 15:46:29,964 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-02-05 15:46:29,965 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 112 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1024 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-02-05 15:46:29,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1024 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18083 states. [2025-02-05 15:46:30,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18083 to 18075. [2025-02-05 15:46:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18075 states, 14775 states have (on average 1.6481895093062606) internal successors, (24352), 14783 states have internal predecessors, (24352), 3272 states have call successors, (3272), 23 states have call predecessors, (3272), 27 states have return successors, (3611), 3270 states have call predecessors, (3611), 3271 states have call successors, (3611) [2025-02-05 15:46:30,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18075 states to 18075 states and 31235 transitions. [2025-02-05 15:46:30,842 INFO L78 Accepts]: Start accepts. Automaton has 18075 states and 31235 transitions. Word has length 148 [2025-02-05 15:46:30,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:30,842 INFO L471 AbstractCegarLoop]: Abstraction has 18075 states and 31235 transitions. [2025-02-05 15:46:30,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:30,843 INFO L276 IsEmpty]: Start isEmpty. Operand 18075 states and 31235 transitions. [2025-02-05 15:46:30,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 15:46:30,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:30,903 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:30,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:46:30,903 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:30,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:30,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1213090980, now seen corresponding path program 1 times [2025-02-05 15:46:30,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:30,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856450024] [2025-02-05 15:46:30,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:30,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:30,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:46:30,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:46:30,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:30,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:30,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:30,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856450024] [2025-02-05 15:46:30,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856450024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:30,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:30,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:30,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811146891] [2025-02-05 15:46:30,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:30,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:30,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:30,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:30,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:30,981 INFO L87 Difference]: Start difference. First operand 18075 states and 31235 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:31,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:31,809 INFO L93 Difference]: Finished difference Result 47755 states and 82871 transitions. [2025-02-05 15:46:31,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:31,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 149 [2025-02-05 15:46:31,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:32,004 INFO L225 Difference]: With dead ends: 47755 [2025-02-05 15:46:32,004 INFO L226 Difference]: Without dead ends: 32253 [2025-02-05 15:46:32,076 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-02-05 15:46:32,077 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 110 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1052 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-02-05 15:46:32,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1052 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:32,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32253 states. [2025-02-05 15:46:33,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32253 to 32245. [2025-02-05 15:46:33,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32245 states, 26495 states have (on average 1.6453293074164936) internal successors, (43593), 26503 states have internal predecessors, (43593), 5722 states have call successors, (5722), 23 states have call predecessors, (5722), 27 states have return successors, (6335), 5720 states have call predecessors, (6335), 5721 states have call successors, (6335) [2025-02-05 15:46:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32245 states to 32245 states and 55650 transitions. [2025-02-05 15:46:34,081 INFO L78 Accepts]: Start accepts. Automaton has 32245 states and 55650 transitions. Word has length 149 [2025-02-05 15:46:34,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:34,082 INFO L471 AbstractCegarLoop]: Abstraction has 32245 states and 55650 transitions. [2025-02-05 15:46:34,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:34,082 INFO L276 IsEmpty]: Start isEmpty. Operand 32245 states and 55650 transitions. [2025-02-05 15:46:34,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 15:46:34,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:34,159 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:34,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:46:34,160 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:34,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:34,161 INFO L85 PathProgramCache]: Analyzing trace with hash 307840583, now seen corresponding path program 1 times [2025-02-05 15:46:34,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:34,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835230775] [2025-02-05 15:46:34,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:34,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:34,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 15:46:34,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 15:46:34,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:34,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:34,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:34,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835230775] [2025-02-05 15:46:34,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835230775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:34,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:34,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:34,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092815458] [2025-02-05 15:46:34,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:34,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:34,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:34,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:34,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:34,237 INFO L87 Difference]: Start difference. First operand 32245 states and 55650 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:35,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:35,722 INFO L93 Difference]: Finished difference Result 87872 states and 152193 transitions. [2025-02-05 15:46:35,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:35,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 150 [2025-02-05 15:46:35,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:36,093 INFO L225 Difference]: With dead ends: 87872 [2025-02-05 15:46:36,094 INFO L226 Difference]: Without dead ends: 59067 [2025-02-05 15:46:36,210 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-02-05 15:46:36,211 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 108 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1055 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-02-05 15:46:36,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1055 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:36,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59067 states. [2025-02-05 15:46:38,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59067 to 59059. [2025-02-05 15:46:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59059 states, 48796 states have (on average 1.6413845397163702) internal successors, (80093), 48804 states have internal predecessors, (80093), 10235 states have call successors, (10235), 23 states have call predecessors, (10235), 27 states have return successors, (11380), 10233 states have call predecessors, (11380), 10234 states have call successors, (11380) [2025-02-05 15:46:39,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59059 states to 59059 states and 101708 transitions. [2025-02-05 15:46:39,349 INFO L78 Accepts]: Start accepts. Automaton has 59059 states and 101708 transitions. Word has length 150 [2025-02-05 15:46:39,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:39,350 INFO L471 AbstractCegarLoop]: Abstraction has 59059 states and 101708 transitions. [2025-02-05 15:46:39,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:39,350 INFO L276 IsEmpty]: Start isEmpty. Operand 59059 states and 101708 transitions. [2025-02-05 15:46:39,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 15:46:39,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:39,435 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:39,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:46:39,435 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:39,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:39,436 INFO L85 PathProgramCache]: Analyzing trace with hash -592741509, now seen corresponding path program 1 times [2025-02-05 15:46:39,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:39,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487473844] [2025-02-05 15:46:39,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:39,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:39,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 15:46:39,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 15:46:39,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:39,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:39,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:39,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487473844] [2025-02-05 15:46:39,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487473844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:39,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:39,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:39,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205966287] [2025-02-05 15:46:39,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:39,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:39,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:39,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:39,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:39,513 INFO L87 Difference]: Start difference. First operand 59059 states and 101708 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:41,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:41,926 INFO L93 Difference]: Finished difference Result 110453 states and 190692 transitions. [2025-02-05 15:46:41,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:41,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 151 [2025-02-05 15:46:41,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:42,858 INFO L225 Difference]: With dead ends: 110453 [2025-02-05 15:46:42,858 INFO L226 Difference]: Without dead ends: 110292 [2025-02-05 15:46:42,924 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-02-05 15:46:42,928 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 103 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1066 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-02-05 15:46:42,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1066 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:43,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110292 states. [2025-02-05 15:46:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110292 to 110284. [2025-02-05 15:46:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110284 states, 91653 states have (on average 1.6362475860037315) internal successors, (149967), 91661 states have internal predecessors, (149967), 18603 states have call successors, (18603), 23 states have call predecessors, (18603), 27 states have return successors, (20794), 18601 states have call predecessors, (20794), 18602 states have call successors, (20794) [2025-02-05 15:46:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110284 states to 110284 states and 189364 transitions. [2025-02-05 15:46:46,801 INFO L78 Accepts]: Start accepts. Automaton has 110284 states and 189364 transitions. Word has length 151 [2025-02-05 15:46:46,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:46,802 INFO L471 AbstractCegarLoop]: Abstraction has 110284 states and 189364 transitions. [2025-02-05 15:46:46,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:46,802 INFO L276 IsEmpty]: Start isEmpty. Operand 110284 states and 189364 transitions. [2025-02-05 15:46:47,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 15:46:47,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:47,483 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:47,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:46:47,484 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:47,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:47,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1974218680, now seen corresponding path program 1 times [2025-02-05 15:46:47,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:47,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218078999] [2025-02-05 15:46:47,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:47,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:47,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 15:46:47,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 15:46:47,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:47,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:46:47,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:47,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218078999] [2025-02-05 15:46:47,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218078999] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:47,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763255609] [2025-02-05 15:46:47,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:47,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:47,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:47,886 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:47,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:46:48,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 15:46:48,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 15:46:48,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:48,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:48,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 15:46:48,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 15:46:48,736 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:48,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763255609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:48,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:48,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2025-02-05 15:46:48,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285063232] [2025-02-05 15:46:48,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:48,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 15:46:48,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:48,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 15:46:48,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:46:48,740 INFO L87 Difference]: Start difference. First operand 110284 states and 189364 transitions. Second operand has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 9 states have internal predecessors, (111), 5 states have call successors, (19), 5 states have call predecessors, (19), 6 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2025-02-05 15:46:54,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:54,016 INFO L93 Difference]: Finished difference Result 219729 states and 382750 transitions. [2025-02-05 15:46:54,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:46:54,016 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 9 states have internal predecessors, (111), 5 states have call successors, (19), 5 states have call predecessors, (19), 6 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 152 [2025-02-05 15:46:54,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:55,316 INFO L225 Difference]: With dead ends: 219729 [2025-02-05 15:46:55,316 INFO L226 Difference]: Without dead ends: 219574 [2025-02-05 15:46:55,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 15:46:55,439 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 1313 mSDsluCounter, 4007 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 4629 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:55,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 4629 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 15:46:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219574 states. [2025-02-05 15:47:03,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219574 to 219546. [2025-02-05 15:47:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219546 states, 182525 states have (on average 1.636899054923983) internal successors, (298775), 182430 states have internal predecessors, (298775), 36954 states have call successors, (36954), 60 states have call predecessors, (36954), 66 states have return successors, (44610), 37061 states have call predecessors, (44610), 36951 states have call successors, (44610)