./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec1_product21.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_spec1_product21.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 cecb11257778d17777e5c48cccb3bea71da01aa9ce120079a5b602041abb00f4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:41:38,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:41:38,447 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:41:38,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:41:38,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:41:38,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:41:38,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:41:38,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:41:38,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:41:38,487 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:41:38,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:41:38,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:41:38,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:41:38,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:41:38,488 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:41:38,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:41:38,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:41:38,489 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:41:38,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:41:38,489 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:41:38,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:41:38,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:41:38,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:41:38,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:41:38,489 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:41:38,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:41:38,489 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:41:38,489 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:41:38,489 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:41:38,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:41:38,489 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:41:38,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:41:38,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:41:38,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:41:38,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:41:38,491 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:41:38,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:41:38,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:41:38,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:41:38,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:41:38,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:41:38,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:41:38,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:41:38,491 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 -> cecb11257778d17777e5c48cccb3bea71da01aa9ce120079a5b602041abb00f4 [2025-02-05 15:41:38,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:41:38,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:41:38,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:41:38,785 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:41:38,786 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:41:38,787 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec1_product21.cil.c [2025-02-05 15:41:40,104 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d9f23ea5/818b7aae1bad4d88a880e78b37826693/FLAG06e3cffbf [2025-02-05 15:41:40,493 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:41:40,495 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product21.cil.c [2025-02-05 15:41:40,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d9f23ea5/818b7aae1bad4d88a880e78b37826693/FLAG06e3cffbf [2025-02-05 15:41:40,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d9f23ea5/818b7aae1bad4d88a880e78b37826693 [2025-02-05 15:41:40,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:41:40,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:41:40,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:41:40,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:41:40,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:41:40,707 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:41:40" (1/1) ... [2025-02-05 15:41:40,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c952fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:40, skipping insertion in model container [2025-02-05 15:41:40,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:41:40" (1/1) ... [2025-02-05 15:41:40,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:41:41,252 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_spec1_product21.cil.c[63391,63404] [2025-02-05 15:41:41,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:41:41,268 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:41:41,274 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [48] [2025-02-05 15:41:41,276 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [90] [2025-02-05 15:41:41,276 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [501] [2025-02-05 15:41:41,276 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [730] [2025-02-05 15:41:41,276 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [836] [2025-02-05 15:41:41,276 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [853] [2025-02-05 15:41:41,276 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1219] [2025-02-05 15:41:41,276 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1257] [2025-02-05 15:41:41,276 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1577] [2025-02-05 15:41:41,276 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2649] [2025-02-05 15:41:41,276 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2937] [2025-02-05 15:41:41,400 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_spec1_product21.cil.c[63391,63404] [2025-02-05 15:41:41,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:41:41,435 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:41:41,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41 WrapperNode [2025-02-05 15:41:41,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:41:41,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:41:41,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:41:41,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:41:41,442 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:41:41" (1/1) ... [2025-02-05 15:41:41,462 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:41:41" (1/1) ... [2025-02-05 15:41:41,529 INFO L138 Inliner]: procedures = 128, calls = 197, calls flagged for inlining = 57, calls inlined = 54, statements flattened = 1060 [2025-02-05 15:41:41,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:41:41,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:41:41,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:41:41,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:41:41,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,546 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,578 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:41:41,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,596 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:41:41,622 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:41:41,622 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:41:41,622 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:41:41,623 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:41:41,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:41,661 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:41:41,665 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:41:41,689 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:41:41,689 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:41:41,689 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:41:41,689 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:41:41,690 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:41:41,690 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:41:41,690 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:41:41,690 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:41:41,690 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:41:41,690 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:41:41,690 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:41:41,691 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:41:41,691 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:41:41,691 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:41:41,691 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:41:41,691 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:41:41,691 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:41:41,691 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:41:41,691 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:41:41,691 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:41:41,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:41:41,691 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:41:41,691 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:41:41,691 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:41:41,691 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:41:41,691 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:41:41,691 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:41:41,691 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:41:41,692 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:41:41,692 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2025-02-05 15:41:41,692 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2025-02-05 15:41:41,692 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:41:41,692 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:41:41,692 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:41:41,692 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:41:41,692 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:41:41,693 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:41:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:41:41,693 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:41:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:41:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:41:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:41:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:41:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:41:41,693 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:41:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:41:41,693 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:41:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:41:41,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:41:41,878 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:41:41,882 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:41:42,017 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2238-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~36#1; [2025-02-05 15:41:42,017 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2283: #res#1 := ~retValue_acc~37#1; [2025-02-05 15:41:42,299 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2579-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~41#1; [2025-02-05 15:41:42,299 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2191-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~35#1; [2025-02-05 15:41:42,299 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L789-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~11#1; [2025-02-05 15:41:42,300 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L145-1: getEmailId_#res#1 := getEmailId_~retValue_acc~1#1; [2025-02-05 15:41:42,300 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2507-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~40#1; [2025-02-05 15:41:42,300 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L809-1: isReadable_#res#1 := isReadable_~retValue_acc~12#1; [2025-02-05 15:41:42,300 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2626-1: getClientId_#res#1 := getClientId_~retValue_acc~42#1; [2025-02-05 15:41:42,300 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L182-1: getEmailFrom_#res#1 := getEmailFrom_~retValue_acc~2#1; [2025-02-05 15:41:42,300 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1545-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~25#1; [2025-02-05 15:41:42,314 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L833-1: createEmail_#res#1 := createEmail_~retValue_acc~14#1; [2025-02-05 15:41:42,325 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1735: #res := ~retValue_acc~29; [2025-02-05 15:41:42,345 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L334: #res := ~retValue_acc~6; [2025-02-05 15:41:42,389 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L371: #res := ~retValue_acc~7; [2025-02-05 15:41:42,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L219: #res := ~retValue_acc~3; [2025-02-05 15:41:42,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2061: #res := ~retValue_acc~33; [2025-02-05 15:41:42,809 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1511-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~23#1; [2025-02-05 15:41:42,809 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~39#1; [2025-02-05 15:41:42,809 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1254-1: valid_product_#res#1 := valid_product_~retValue_acc~20#1; [2025-02-05 15:41:42,809 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1502-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~22#1; [2025-02-05 15:41:42,809 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1520-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~24#1; [2025-02-05 15:41:42,809 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2346-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~38#1; [2025-02-05 15:41:42,959 INFO L? ?]: Removed 521 outVars from TransFormulas that were not future-live. [2025-02-05 15:41:42,959 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:41:42,981 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:41:42,982 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:41:42,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:41:42 BoogieIcfgContainer [2025-02-05 15:41:42,983 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:41:42,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:41:42,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:41:42,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:41:42,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:41:40" (1/3) ... [2025-02-05 15:41:42,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce8acb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:41:42, skipping insertion in model container [2025-02-05 15:41:42,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (2/3) ... [2025-02-05 15:41:42,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce8acb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:41:42, skipping insertion in model container [2025-02-05 15:41:42,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:41:42" (3/3) ... [2025-02-05 15:41:42,993 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec1_product21.cil.c [2025-02-05 15:41:43,007 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:41:43,011 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec1_product21.cil.c that has 22 procedures, 375 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:41:43,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:41:43,095 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;@57bd487, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:41:43,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:41:43,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 375 states, 295 states have (on average 1.5694915254237287) internal successors, (463), 300 states have internal predecessors, (463), 57 states have call successors, (57), 21 states have call predecessors, (57), 21 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-05 15:41:43,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 15:41:43,118 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:43,118 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:43,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:43,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:43,124 INFO L85 PathProgramCache]: Analyzing trace with hash 970503363, now seen corresponding path program 1 times [2025-02-05 15:41:43,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:43,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828381607] [2025-02-05 15:41:43,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:43,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:43,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 15:41:43,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 15:41:43,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:43,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:43,905 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:41:43,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:43,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828381607] [2025-02-05 15:41:43,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828381607] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:43,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171633042] [2025-02-05 15:41:43,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:43,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:43,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:43,914 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:41:43,918 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:41:44,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 15:41:44,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 15:41:44,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:44,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:44,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:41:44,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:44,319 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:41:44,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:44,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171633042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:44,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:44,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:41:44,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069060148] [2025-02-05 15:41:44,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:44,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:41:44,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:44,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:41:44,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:44,357 INFO L87 Difference]: Start difference. First operand has 375 states, 295 states have (on average 1.5694915254237287) internal successors, (463), 300 states have internal predecessors, (463), 57 states have call successors, (57), 21 states have call predecessors, (57), 21 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:44,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:44,421 INFO L93 Difference]: Finished difference Result 558 states and 846 transitions. [2025-02-05 15:41:44,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:41:44,423 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2025-02-05 15:41:44,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:44,439 INFO L225 Difference]: With dead ends: 558 [2025-02-05 15:41:44,439 INFO L226 Difference]: Without dead ends: 368 [2025-02-05 15:41:44,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:44,454 INFO L435 NwaCegarLoop]: 574 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, 574 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:41:44,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:44,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-02-05 15:41:44,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-02-05 15:41:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 289 states have (on average 1.5674740484429066) internal successors, (453), 293 states have internal predecessors, (453), 57 states have call successors, (57), 21 states have call predecessors, (57), 21 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-05 15:41:44,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 566 transitions. [2025-02-05 15:41:44,526 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 566 transitions. Word has length 98 [2025-02-05 15:41:44,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:44,527 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 566 transitions. [2025-02-05 15:41:44,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:44,528 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 566 transitions. [2025-02-05 15:41:44,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 15:41:44,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:44,534 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:44,542 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:41:44,735 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:41:44,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:44,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:44,736 INFO L85 PathProgramCache]: Analyzing trace with hash 399890701, now seen corresponding path program 1 times [2025-02-05 15:41:44,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:44,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892511172] [2025-02-05 15:41:44,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:44,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:44,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:41:44,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:41:44,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:44,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:45,012 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:41:45,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:45,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892511172] [2025-02-05 15:41:45,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892511172] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:45,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547530861] [2025-02-05 15:41:45,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:45,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:45,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:45,017 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:41:45,019 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:41:45,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:41:45,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:41:45,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:45,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:45,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:41:45,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:41:45,393 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:45,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547530861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:45,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:45,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:41:45,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380571366] [2025-02-05 15:41:45,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:45,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:45,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:45,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:45,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:41:45,398 INFO L87 Difference]: Start difference. First operand 368 states and 566 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:45,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:45,450 INFO L93 Difference]: Finished difference Result 547 states and 824 transitions. [2025-02-05 15:41:45,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:45,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2025-02-05 15:41:45,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:45,459 INFO L225 Difference]: With dead ends: 547 [2025-02-05 15:41:45,459 INFO L226 Difference]: Without dead ends: 370 [2025-02-05 15:41:45,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 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:41:45,463 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 0 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1128 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:41:45,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1128 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:45,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-02-05 15:41:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-02-05 15:41:45,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 291 states have (on average 1.563573883161512) internal successors, (455), 295 states have internal predecessors, (455), 57 states have call successors, (57), 21 states have call predecessors, (57), 21 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-05 15:41:45,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 568 transitions. [2025-02-05 15:41:45,498 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 568 transitions. Word has length 99 [2025-02-05 15:41:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:45,500 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 568 transitions. [2025-02-05 15:41:45,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 568 transitions. [2025-02-05 15:41:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 15:41:45,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:45,505 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:45,515 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:41:45,705 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:41:45,706 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:45,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:45,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1663737816, now seen corresponding path program 1 times [2025-02-05 15:41:45,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:45,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716274886] [2025-02-05 15:41:45,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:45,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:45,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 15:41:45,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 15:41:45,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:45,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:41:45,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:45,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716274886] [2025-02-05 15:41:45,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716274886] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:45,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300222889] [2025-02-05 15:41:45,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:45,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:45,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:45,999 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:41:46,002 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:41:46,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 15:41:46,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 15:41:46,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:46,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:46,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:41:46,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:46,359 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:41:46,359 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:46,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300222889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:46,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:46,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:41:46,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220337030] [2025-02-05 15:41:46,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:46,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:46,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:46,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:46,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:41:46,365 INFO L87 Difference]: Start difference. First operand 370 states and 568 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:46,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:46,418 INFO L93 Difference]: Finished difference Result 787 states and 1227 transitions. [2025-02-05 15:41:46,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:46,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2025-02-05 15:41:46,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:46,424 INFO L225 Difference]: With dead ends: 787 [2025-02-05 15:41:46,424 INFO L226 Difference]: Without dead ends: 444 [2025-02-05 15:41:46,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 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:41:46,427 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 134 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1084 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:41:46,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1084 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:46,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-02-05 15:41:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 436. [2025-02-05 15:41:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 343 states have (on average 1.5830903790087463) internal successors, (543), 347 states have internal predecessors, (543), 71 states have call successors, (71), 21 states have call predecessors, (71), 21 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-05 15:41:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 684 transitions. [2025-02-05 15:41:46,458 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 684 transitions. Word has length 104 [2025-02-05 15:41:46,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:46,459 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 684 transitions. [2025-02-05 15:41:46,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:46,460 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 684 transitions. [2025-02-05 15:41:46,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 15:41:46,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:46,463 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:46,473 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:41:46,667 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:41:46,667 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:46,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:46,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1881581864, now seen corresponding path program 1 times [2025-02-05 15:41:46,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:46,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690192479] [2025-02-05 15:41:46,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:46,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:46,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 15:41:46,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 15:41:46,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:46,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:46,870 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:41:46,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:46,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690192479] [2025-02-05 15:41:46,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690192479] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:46,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945275132] [2025-02-05 15:41:46,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:46,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:46,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:46,875 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:41:46,877 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:41:47,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 15:41:47,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 15:41:47,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:47,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:47,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:41:47,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:47,254 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:41:47,254 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:47,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945275132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:47,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:47,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:41:47,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310311880] [2025-02-05 15:41:47,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:47,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:47,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:47,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:47,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:41:47,257 INFO L87 Difference]: Start difference. First operand 436 states and 684 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:47,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:47,347 INFO L93 Difference]: Finished difference Result 863 states and 1358 transitions. [2025-02-05 15:41:47,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:47,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2025-02-05 15:41:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:47,352 INFO L225 Difference]: With dead ends: 863 [2025-02-05 15:41:47,353 INFO L226 Difference]: Without dead ends: 438 [2025-02-05 15:41:47,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 103 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:41:47,356 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 2 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2221 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:41:47,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2221 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:47,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-02-05 15:41:47,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-02-05 15:41:47,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 344 states have (on average 1.5813953488372092) internal successors, (544), 349 states have internal predecessors, (544), 71 states have call successors, (71), 21 states have call predecessors, (71), 22 states have return successors, (72), 69 states have call predecessors, (72), 70 states have call successors, (72) [2025-02-05 15:41:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 687 transitions. [2025-02-05 15:41:47,383 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 687 transitions. Word has length 105 [2025-02-05 15:41:47,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:47,384 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 687 transitions. [2025-02-05 15:41:47,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:47,384 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 687 transitions. [2025-02-05 15:41:47,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 15:41:47,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:47,388 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:47,398 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:41:47,589 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:41:47,589 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:47,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:47,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1105997704, now seen corresponding path program 1 times [2025-02-05 15:41:47,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:47,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755847077] [2025-02-05 15:41:47,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:47,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:47,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 15:41:47,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 15:41:47,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:47,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:47,790 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:41:47,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:47,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755847077] [2025-02-05 15:41:47,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755847077] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:47,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206790223] [2025-02-05 15:41:47,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:47,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:47,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:47,794 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:41:47,796 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:41:47,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 15:41:48,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 15:41:48,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:48,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:48,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 1010 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:41:48,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:41:48,156 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:48,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206790223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:48,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:48,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:41:48,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131773075] [2025-02-05 15:41:48,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:48,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:48,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:48,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:48,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:41:48,159 INFO L87 Difference]: Start difference. First operand 438 states and 687 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:48,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:48,246 INFO L93 Difference]: Finished difference Result 865 states and 1363 transitions. [2025-02-05 15:41:48,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:48,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2025-02-05 15:41:48,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:48,252 INFO L225 Difference]: With dead ends: 865 [2025-02-05 15:41:48,254 INFO L226 Difference]: Without dead ends: 440 [2025-02-05 15:41:48,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:41:48,258 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 2 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2207 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:41:48,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2207 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:48,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-02-05 15:41:48,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2025-02-05 15:41:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 345 states have (on average 1.5797101449275361) internal successors, (545), 351 states have internal predecessors, (545), 71 states have call successors, (71), 21 states have call predecessors, (71), 23 states have return successors, (77), 69 states have call predecessors, (77), 70 states have call successors, (77) [2025-02-05 15:41:48,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 693 transitions. [2025-02-05 15:41:48,291 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 693 transitions. Word has length 106 [2025-02-05 15:41:48,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:48,291 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 693 transitions. [2025-02-05 15:41:48,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:48,292 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 693 transitions. [2025-02-05 15:41:48,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 15:41:48,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:48,294 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:48,305 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:41:48,495 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:41:48,495 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:48,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:48,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1573283215, now seen corresponding path program 1 times [2025-02-05 15:41:48,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:48,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690804964] [2025-02-05 15:41:48,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:48,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:48,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:41:48,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:41:48,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:48,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:48,650 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:41:48,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:48,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690804964] [2025-02-05 15:41:48,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690804964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:48,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:48,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:41:48,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930688885] [2025-02-05 15:41:48,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:48,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:48,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:48,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:48,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:48,652 INFO L87 Difference]: Start difference. First operand 440 states and 693 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:48,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:48,708 INFO L93 Difference]: Finished difference Result 857 states and 1354 transitions. [2025-02-05 15:41:48,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:48,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 107 [2025-02-05 15:41:48,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:48,712 INFO L225 Difference]: With dead ends: 857 [2025-02-05 15:41:48,712 INFO L226 Difference]: Without dead ends: 440 [2025-02-05 15:41:48,714 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:41:48,715 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 2 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2225 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:41:48,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2225 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:48,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-02-05 15:41:48,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2025-02-05 15:41:48,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 345 states have (on average 1.5797101449275361) internal successors, (545), 351 states have internal predecessors, (545), 71 states have call successors, (71), 21 states have call predecessors, (71), 23 states have return successors, (76), 69 states have call predecessors, (76), 70 states have call successors, (76) [2025-02-05 15:41:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 692 transitions. [2025-02-05 15:41:48,745 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 692 transitions. Word has length 107 [2025-02-05 15:41:48,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:48,745 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 692 transitions. [2025-02-05 15:41:48,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 692 transitions. [2025-02-05 15:41:48,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:41:48,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:48,749 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:48,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:41:48,750 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:48,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:48,753 INFO L85 PathProgramCache]: Analyzing trace with hash -739947661, now seen corresponding path program 2 times [2025-02-05 15:41:48,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:48,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505539707] [2025-02-05 15:41:48,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:41:48,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:48,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-02-05 15:41:48,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:41:48,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:41:48,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:48,924 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:41:48,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:48,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505539707] [2025-02-05 15:41:48,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505539707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:48,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:48,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:41:48,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768204740] [2025-02-05 15:41:48,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:48,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:48,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:48,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:48,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:48,928 INFO L87 Difference]: Start difference. First operand 440 states and 692 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:48,997 INFO L93 Difference]: Finished difference Result 855 states and 1349 transitions. [2025-02-05 15:41:48,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:48,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-02-05 15:41:48,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:49,001 INFO L225 Difference]: With dead ends: 855 [2025-02-05 15:41:49,001 INFO L226 Difference]: Without dead ends: 440 [2025-02-05 15:41:49,003 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:41:49,003 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 2 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2211 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:41:49,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2211 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-02-05 15:41:49,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2025-02-05 15:41:49,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 345 states have (on average 1.5797101449275361) internal successors, (545), 351 states have internal predecessors, (545), 71 states have call successors, (71), 21 states have call predecessors, (71), 23 states have return successors, (75), 69 states have call predecessors, (75), 70 states have call successors, (75) [2025-02-05 15:41:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 691 transitions. [2025-02-05 15:41:49,035 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 691 transitions. Word has length 108 [2025-02-05 15:41:49,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:49,035 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 691 transitions. [2025-02-05 15:41:49,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 691 transitions. [2025-02-05 15:41:49,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 15:41:49,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:49,038 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] [2025-02-05 15:41:49,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:41:49,039 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:49,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:49,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1861585598, now seen corresponding path program 3 times [2025-02-05 15:41:49,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:49,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442507975] [2025-02-05 15:41:49,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:41:49,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:49,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 109 statements into 3 equivalence classes. [2025-02-05 15:41:49,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 97 of 109 statements. [2025-02-05 15:41:49,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:41:49,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:49,166 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:41:49,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:49,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442507975] [2025-02-05 15:41:49,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442507975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:49,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:49,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:41:49,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115983783] [2025-02-05 15:41:49,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:49,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:49,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:49,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:49,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:49,170 INFO L87 Difference]: Start difference. First operand 440 states and 691 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:49,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:49,234 INFO L93 Difference]: Finished difference Result 857 states and 1355 transitions. [2025-02-05 15:41:49,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:49,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2025-02-05 15:41:49,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:49,240 INFO L225 Difference]: With dead ends: 857 [2025-02-05 15:41:49,240 INFO L226 Difference]: Without dead ends: 442 [2025-02-05 15:41:49,241 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:41:49,242 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 1 mSDsluCounter, 1662 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2222 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:41:49,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2222 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:49,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-02-05 15:41:49,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-02-05 15:41:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 346 states have (on average 1.5780346820809248) internal successors, (546), 353 states have internal predecessors, (546), 71 states have call successors, (71), 21 states have call predecessors, (71), 24 states have return successors, (80), 69 states have call predecessors, (80), 70 states have call successors, (80) [2025-02-05 15:41:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 697 transitions. [2025-02-05 15:41:49,264 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 697 transitions. Word has length 109 [2025-02-05 15:41:49,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:49,265 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 697 transitions. [2025-02-05 15:41:49,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:49,265 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 697 transitions. [2025-02-05 15:41:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 15:41:49,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:49,267 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:49,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:41:49,269 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:49,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:49,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1265355881, now seen corresponding path program 1 times [2025-02-05 15:41:49,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:49,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645362634] [2025-02-05 15:41:49,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:49,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:49,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:41:49,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:41:49,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:49,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:41:49,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:49,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645362634] [2025-02-05 15:41:49,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645362634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:49,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:49,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:41:49,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199890467] [2025-02-05 15:41:49,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:49,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:49,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:49,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:49,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:49,425 INFO L87 Difference]: Start difference. First operand 442 states and 697 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:49,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:49,471 INFO L93 Difference]: Finished difference Result 863 states and 1365 transitions. [2025-02-05 15:41:49,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:49,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2025-02-05 15:41:49,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:49,475 INFO L225 Difference]: With dead ends: 863 [2025-02-05 15:41:49,475 INFO L226 Difference]: Without dead ends: 444 [2025-02-05 15:41:49,477 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:41:49,477 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 1 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2228 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:41:49,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2228 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:49,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-02-05 15:41:49,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-02-05 15:41:49,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 347 states have (on average 1.5763688760806915) internal successors, (547), 355 states have internal predecessors, (547), 71 states have call successors, (71), 21 states have call predecessors, (71), 25 states have return successors, (82), 69 states have call predecessors, (82), 70 states have call successors, (82) [2025-02-05 15:41:49,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 700 transitions. [2025-02-05 15:41:49,497 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 700 transitions. Word has length 110 [2025-02-05 15:41:49,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:49,497 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 700 transitions. [2025-02-05 15:41:49,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:49,497 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 700 transitions. [2025-02-05 15:41:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 15:41:49,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:49,500 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:49,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:41:49,501 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:49,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:49,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1627415720, now seen corresponding path program 1 times [2025-02-05 15:41:49,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:49,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291376672] [2025-02-05 15:41:49,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:49,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:49,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 15:41:49,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:41:49,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:49,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:41:49,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:49,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291376672] [2025-02-05 15:41:49,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291376672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:49,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:49,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:41:49,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417332916] [2025-02-05 15:41:49,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:49,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:49,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:49,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:49,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:49,609 INFO L87 Difference]: Start difference. First operand 444 states and 700 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:49,672 INFO L93 Difference]: Finished difference Result 863 states and 1368 transitions. [2025-02-05 15:41:49,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:49,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2025-02-05 15:41:49,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:49,676 INFO L225 Difference]: With dead ends: 863 [2025-02-05 15:41:49,677 INFO L226 Difference]: Without dead ends: 446 [2025-02-05 15:41:49,678 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:41:49,679 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 0 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:49,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2207 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:49,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-02-05 15:41:49,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 444. [2025-02-05 15:41:49,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 347 states have (on average 1.5763688760806915) internal successors, (547), 355 states have internal predecessors, (547), 71 states have call successors, (71), 21 states have call predecessors, (71), 25 states have return successors, (82), 69 states have call predecessors, (82), 70 states have call successors, (82) [2025-02-05 15:41:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 700 transitions. [2025-02-05 15:41:49,699 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 700 transitions. Word has length 111 [2025-02-05 15:41:49,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:49,699 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 700 transitions. [2025-02-05 15:41:49,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:49,700 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 700 transitions. [2025-02-05 15:41:49,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 15:41:49,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:49,702 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:49,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:41:49,703 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:49,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:49,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1019338857, now seen corresponding path program 1 times [2025-02-05 15:41:49,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:49,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323611015] [2025-02-05 15:41:49,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:49,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:49,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 15:41:49,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:41:49,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:49,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:49,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:49,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323611015] [2025-02-05 15:41:49,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323611015] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:49,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732260158] [2025-02-05 15:41:49,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:49,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:49,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:49,844 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:41:49,846 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:41:49,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 15:41:50,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:41:50,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:50,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:50,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:41:50,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:50,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:41:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:50,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732260158] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:41:50,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:41:50,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 15:41:50,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58768030] [2025-02-05 15:41:50,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:41:50,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:41:50,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:50,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:41:50,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:41:50,248 INFO L87 Difference]: Start difference. First operand 444 states and 700 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:41:50,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:50,409 INFO L93 Difference]: Finished difference Result 1058 states and 1724 transitions. [2025-02-05 15:41:50,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:41:50,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 111 [2025-02-05 15:41:50,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:50,417 INFO L225 Difference]: With dead ends: 1058 [2025-02-05 15:41:50,417 INFO L226 Difference]: Without dead ends: 881 [2025-02-05 15:41:50,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 219 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:41:50,419 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 520 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:50,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 2092 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:41:50,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-02-05 15:41:50,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 857. [2025-02-05 15:41:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 681 states have (on average 1.6372980910425845) internal successors, (1115), 689 states have internal predecessors, (1115), 150 states have call successors, (150), 21 states have call predecessors, (150), 25 states have return successors, (171), 148 states have call predecessors, (171), 149 states have call successors, (171) [2025-02-05 15:41:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1436 transitions. [2025-02-05 15:41:50,458 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1436 transitions. Word has length 111 [2025-02-05 15:41:50,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:50,458 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1436 transitions. [2025-02-05 15:41:50,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:41:50,458 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1436 transitions. [2025-02-05 15:41:50,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 15:41:50,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:50,463 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:50,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 15:41:50,664 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,SelfDestructingSolverStorable10 [2025-02-05 15:41:50,665 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:50,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:50,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1455337737, now seen corresponding path program 1 times [2025-02-05 15:41:50,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:50,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802604263] [2025-02-05 15:41:50,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:50,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:50,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 15:41:50,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 15:41:50,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:50,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:50,737 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:50,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:50,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802604263] [2025-02-05 15:41:50,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802604263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:50,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:50,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:50,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349373881] [2025-02-05 15:41:50,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:50,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:50,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:50,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:50,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:50,739 INFO L87 Difference]: Start difference. First operand 857 states and 1436 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:50,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:50,789 INFO L93 Difference]: Finished difference Result 2066 states and 3506 transitions. [2025-02-05 15:41:50,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:50,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2025-02-05 15:41:50,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:50,801 INFO L225 Difference]: With dead ends: 2066 [2025-02-05 15:41:50,801 INFO L226 Difference]: Without dead ends: 1275 [2025-02-05 15:41:50,805 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:41:50,806 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 132 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1148 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:41:50,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1148 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:50,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2025-02-05 15:41:50,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1267. [2025-02-05 15:41:50,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 1012 states have (on average 1.650197628458498) internal successors, (1670), 1020 states have internal predecessors, (1670), 229 states have call successors, (229), 21 states have call predecessors, (229), 25 states have return successors, (260), 227 states have call predecessors, (260), 228 states have call successors, (260) [2025-02-05 15:41:50,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 2159 transitions. [2025-02-05 15:41:50,914 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 2159 transitions. Word has length 117 [2025-02-05 15:41:50,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:50,915 INFO L471 AbstractCegarLoop]: Abstraction has 1267 states and 2159 transitions. [2025-02-05 15:41:50,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:50,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 2159 transitions. [2025-02-05 15:41:50,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:41:50,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:50,924 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:50,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:41:50,924 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:50,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:50,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2052564074, now seen corresponding path program 1 times [2025-02-05 15:41:50,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:50,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334323791] [2025-02-05 15:41:50,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:50,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:50,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:41:50,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:41:50,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:50,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:51,002 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:51,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:51,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334323791] [2025-02-05 15:41:51,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334323791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:51,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:51,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:51,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670699168] [2025-02-05 15:41:51,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:51,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:51,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:51,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:51,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:51,005 INFO L87 Difference]: Start difference. First operand 1267 states and 2159 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:51,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:51,091 INFO L93 Difference]: Finished difference Result 3069 states and 5257 transitions. [2025-02-05 15:41:51,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:51,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-02-05 15:41:51,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:51,106 INFO L225 Difference]: With dead ends: 3069 [2025-02-05 15:41:51,106 INFO L226 Difference]: Without dead ends: 1919 [2025-02-05 15:41:51,113 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:41:51,113 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 130 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1132 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:41:51,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:51,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2025-02-05 15:41:51,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1911. [2025-02-05 15:41:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1911 states, 1537 states have (on average 1.6584255042290175) internal successors, (2549), 1545 states have internal predecessors, (2549), 348 states have call successors, (348), 21 states have call predecessors, (348), 25 states have return successors, (379), 346 states have call predecessors, (379), 347 states have call successors, (379) [2025-02-05 15:41:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 3276 transitions. [2025-02-05 15:41:51,231 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 3276 transitions. Word has length 118 [2025-02-05 15:41:51,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:51,231 INFO L471 AbstractCegarLoop]: Abstraction has 1911 states and 3276 transitions. [2025-02-05 15:41:51,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 3276 transitions. [2025-02-05 15:41:51,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:41:51,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:51,243 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:51,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:41:51,243 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:51,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:51,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1856289386, now seen corresponding path program 1 times [2025-02-05 15:41:51,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:51,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636606786] [2025-02-05 15:41:51,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:51,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:51,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:41:51,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:41:51,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:51,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:51,317 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:51,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:51,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636606786] [2025-02-05 15:41:51,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636606786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:51,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:51,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:51,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444637341] [2025-02-05 15:41:51,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:51,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:51,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:51,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:51,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:51,320 INFO L87 Difference]: Start difference. First operand 1911 states and 3276 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:51,467 INFO L93 Difference]: Finished difference Result 4581 states and 7907 transitions. [2025-02-05 15:41:51,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:51,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-02-05 15:41:51,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:51,492 INFO L225 Difference]: With dead ends: 4581 [2025-02-05 15:41:51,492 INFO L226 Difference]: Without dead ends: 2909 [2025-02-05 15:41:51,501 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:41:51,502 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 128 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1121 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:41:51,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1121 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:51,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2025-02-05 15:41:51,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2901. [2025-02-05 15:41:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2901 states, 2365 states have (on average 1.6651162790697673) internal successors, (3938), 2373 states have internal predecessors, (3938), 510 states have call successors, (510), 21 states have call predecessors, (510), 25 states have return successors, (557), 508 states have call predecessors, (557), 509 states have call successors, (557) [2025-02-05 15:41:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2901 states and 5005 transitions. [2025-02-05 15:41:51,690 INFO L78 Accepts]: Start accepts. Automaton has 2901 states and 5005 transitions. Word has length 119 [2025-02-05 15:41:51,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:51,690 INFO L471 AbstractCegarLoop]: Abstraction has 2901 states and 5005 transitions. [2025-02-05 15:41:51,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 5005 transitions. [2025-02-05 15:41:51,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:41:51,705 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:51,705 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:51,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:41:51,706 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:51,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:51,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1900529813, now seen corresponding path program 1 times [2025-02-05 15:41:51,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:51,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330828730] [2025-02-05 15:41:51,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:51,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:51,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:41:51,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:41:51,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:51,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:51,778 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:51,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:51,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330828730] [2025-02-05 15:41:51,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330828730] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:51,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:51,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:51,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352319212] [2025-02-05 15:41:51,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:51,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:51,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:51,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:51,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:51,780 INFO L87 Difference]: Start difference. First operand 2901 states and 5005 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:51,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:51,962 INFO L93 Difference]: Finished difference Result 6974 states and 12108 transitions. [2025-02-05 15:41:51,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:51,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-02-05 15:41:51,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:51,992 INFO L225 Difference]: With dead ends: 6974 [2025-02-05 15:41:51,993 INFO L226 Difference]: Without dead ends: 4512 [2025-02-05 15:41:52,004 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:41:52,004 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 126 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1121 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:41:52,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1121 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:52,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2025-02-05 15:41:52,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 4504. [2025-02-05 15:41:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4504 states, 3723 states have (on average 1.6698898737577224) internal successors, (6217), 3731 states have internal predecessors, (6217), 755 states have call successors, (755), 21 states have call predecessors, (755), 25 states have return successors, (828), 753 states have call predecessors, (828), 754 states have call successors, (828) [2025-02-05 15:41:52,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4504 states to 4504 states and 7800 transitions. [2025-02-05 15:41:52,272 INFO L78 Accepts]: Start accepts. Automaton has 4504 states and 7800 transitions. Word has length 120 [2025-02-05 15:41:52,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:52,272 INFO L471 AbstractCegarLoop]: Abstraction has 4504 states and 7800 transitions. [2025-02-05 15:41:52,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:52,273 INFO L276 IsEmpty]: Start isEmpty. Operand 4504 states and 7800 transitions. [2025-02-05 15:41:52,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 15:41:52,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:52,294 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:52,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:41:52,295 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:52,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:52,295 INFO L85 PathProgramCache]: Analyzing trace with hash 349967701, now seen corresponding path program 1 times [2025-02-05 15:41:52,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:52,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776439957] [2025-02-05 15:41:52,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:52,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:52,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:41:52,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:41:52,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:52,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:52,369 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:52,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:52,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776439957] [2025-02-05 15:41:52,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776439957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:52,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:52,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:52,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367423169] [2025-02-05 15:41:52,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:52,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:52,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:52,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:52,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:52,371 INFO L87 Difference]: Start difference. First operand 4504 states and 7800 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:52,632 INFO L93 Difference]: Finished difference Result 10964 states and 19112 transitions. [2025-02-05 15:41:52,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:52,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-02-05 15:41:52,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:52,699 INFO L225 Difference]: With dead ends: 10964 [2025-02-05 15:41:52,699 INFO L226 Difference]: Without dead ends: 7206 [2025-02-05 15:41:52,722 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:41:52,722 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 124 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1140 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:41:52,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1140 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:52,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7206 states. [2025-02-05 15:41:53,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7206 to 7198. [2025-02-05 15:41:53,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7198 states, 5924 states have (on average 1.6682984469952735) internal successors, (9883), 5932 states have internal predecessors, (9883), 1248 states have call successors, (1248), 21 states have call predecessors, (1248), 25 states have return successors, (1365), 1246 states have call predecessors, (1365), 1247 states have call successors, (1365) [2025-02-05 15:41:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7198 states to 7198 states and 12496 transitions. [2025-02-05 15:41:53,202 INFO L78 Accepts]: Start accepts. Automaton has 7198 states and 12496 transitions. Word has length 121 [2025-02-05 15:41:53,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:53,203 INFO L471 AbstractCegarLoop]: Abstraction has 7198 states and 12496 transitions. [2025-02-05 15:41:53,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand 7198 states and 12496 transitions. [2025-02-05 15:41:53,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 15:41:53,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:53,230 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:53,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:41:53,231 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:53,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:53,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1066098796, now seen corresponding path program 1 times [2025-02-05 15:41:53,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:53,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739270440] [2025-02-05 15:41:53,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:53,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:53,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 15:41:53,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:41:53,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:53,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:53,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:53,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739270440] [2025-02-05 15:41:53,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739270440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:53,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:53,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:53,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778101505] [2025-02-05 15:41:53,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:53,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:53,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:53,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:53,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:53,315 INFO L87 Difference]: Start difference. First operand 7198 states and 12496 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:53,782 INFO L93 Difference]: Finished difference Result 18194 states and 31780 transitions. [2025-02-05 15:41:53,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:53,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-02-05 15:41:53,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:53,852 INFO L225 Difference]: With dead ends: 18194 [2025-02-05 15:41:53,853 INFO L226 Difference]: Without dead ends: 12113 [2025-02-05 15:41:53,885 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:41:53,886 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 122 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1124 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:41:53,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:53,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12113 states. [2025-02-05 15:41:54,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12113 to 12105. [2025-02-05 15:41:54,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12105 states, 10009 states have (on average 1.6685982615645918) internal successors, (16701), 10017 states have internal predecessors, (16701), 2070 states have call successors, (2070), 21 states have call predecessors, (2070), 25 states have return successors, (2265), 2068 states have call predecessors, (2265), 2069 states have call successors, (2265) [2025-02-05 15:41:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12105 states to 12105 states and 21036 transitions. [2025-02-05 15:41:54,575 INFO L78 Accepts]: Start accepts. Automaton has 12105 states and 21036 transitions. Word has length 122 [2025-02-05 15:41:54,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:54,575 INFO L471 AbstractCegarLoop]: Abstraction has 12105 states and 21036 transitions. [2025-02-05 15:41:54,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:54,576 INFO L276 IsEmpty]: Start isEmpty. Operand 12105 states and 21036 transitions. [2025-02-05 15:41:54,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:41:54,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:54,607 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:54,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:41:54,607 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:54,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:54,608 INFO L85 PathProgramCache]: Analyzing trace with hash -795836620, now seen corresponding path program 1 times [2025-02-05 15:41:54,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:54,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400738750] [2025-02-05 15:41:54,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:54,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:54,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:41:54,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:41:54,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:54,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:54,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:54,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400738750] [2025-02-05 15:41:54,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400738750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:54,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:54,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:54,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355526116] [2025-02-05 15:41:54,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:54,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:54,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:54,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:54,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:54,672 INFO L87 Difference]: Start difference. First operand 12105 states and 21036 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:55,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:55,157 INFO L93 Difference]: Finished difference Result 28950 states and 50262 transitions. [2025-02-05 15:41:55,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:55,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2025-02-05 15:41:55,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:55,324 INFO L225 Difference]: With dead ends: 28950 [2025-02-05 15:41:55,324 INFO L226 Difference]: Without dead ends: 18929 [2025-02-05 15:41:55,358 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:41:55,358 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 120 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1104 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:41:55,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1104 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:55,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18929 states. [2025-02-05 15:41:56,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18929 to 18921. [2025-02-05 15:41:56,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18921 states, 15622 states have (on average 1.6454999359877096) internal successors, (25706), 15630 states have internal predecessors, (25706), 3273 states have call successors, (3273), 21 states have call predecessors, (3273), 25 states have return successors, (3612), 3271 states have call predecessors, (3612), 3272 states have call successors, (3612) [2025-02-05 15:41:56,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18921 states to 18921 states and 32591 transitions. [2025-02-05 15:41:56,329 INFO L78 Accepts]: Start accepts. Automaton has 18921 states and 32591 transitions. Word has length 123 [2025-02-05 15:41:56,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:56,330 INFO L471 AbstractCegarLoop]: Abstraction has 18921 states and 32591 transitions. [2025-02-05 15:41:56,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:56,330 INFO L276 IsEmpty]: Start isEmpty. Operand 18921 states and 32591 transitions. [2025-02-05 15:41:56,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 15:41:56,364 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:56,365 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:56,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:41:56,365 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:56,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:56,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1983251693, now seen corresponding path program 1 times [2025-02-05 15:41:56,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:56,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865790288] [2025-02-05 15:41:56,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:56,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:56,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 15:41:56,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:41:56,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:56,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:56,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:56,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865790288] [2025-02-05 15:41:56,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865790288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:56,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:56,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:56,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138557317] [2025-02-05 15:41:56,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:56,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:56,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:56,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:56,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:56,447 INFO L87 Difference]: Start difference. First operand 18921 states and 32591 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:57,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:57,397 INFO L93 Difference]: Finished difference Result 49987 states and 86447 transitions. [2025-02-05 15:41:57,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:57,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2025-02-05 15:41:57,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:57,572 INFO L225 Difference]: With dead ends: 49987 [2025-02-05 15:41:57,573 INFO L226 Difference]: Without dead ends: 33784 [2025-02-05 15:41:57,644 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:41:57,645 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 118 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1124 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:41:57,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:57,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33784 states. [2025-02-05 15:41:58,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33784 to 33776. [2025-02-05 15:41:58,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33776 states, 28027 states have (on average 1.6428087201627002) internal successors, (46043), 28035 states have internal predecessors, (46043), 5723 states have call successors, (5723), 21 states have call predecessors, (5723), 25 states have return successors, (6336), 5721 states have call predecessors, (6336), 5722 states have call successors, (6336) [2025-02-05 15:41:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33776 states to 33776 states and 58102 transitions. [2025-02-05 15:41:59,092 INFO L78 Accepts]: Start accepts. Automaton has 33776 states and 58102 transitions. Word has length 124 [2025-02-05 15:41:59,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:59,092 INFO L471 AbstractCegarLoop]: Abstraction has 33776 states and 58102 transitions. [2025-02-05 15:41:59,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:59,093 INFO L276 IsEmpty]: Start isEmpty. Operand 33776 states and 58102 transitions. [2025-02-05 15:41:59,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:41:59,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:59,124 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:59,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:41:59,124 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:59,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:59,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1281321011, now seen corresponding path program 1 times [2025-02-05 15:41:59,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:59,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18508971] [2025-02-05 15:41:59,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:59,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:59,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:41:59,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:41:59,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:59,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:59,183 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:59,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:59,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18508971] [2025-02-05 15:41:59,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18508971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:59,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:59,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:59,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801641504] [2025-02-05 15:41:59,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:59,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:59,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:59,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:59,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:59,186 INFO L87 Difference]: Start difference. First operand 33776 states and 58102 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:42:00,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:00,926 INFO L93 Difference]: Finished difference Result 92079 states and 158929 transitions. [2025-02-05 15:42:00,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:00,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2025-02-05 15:42:00,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:01,313 INFO L225 Difference]: With dead ends: 92079 [2025-02-05 15:42:01,314 INFO L226 Difference]: Without dead ends: 61928 [2025-02-05 15:42:01,439 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:42:01,442 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 116 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1137 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:42:01,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1137 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:01,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61928 states. [2025-02-05 15:42:03,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61928 to 61920. [2025-02-05 15:42:04,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61920 states, 51658 states have (on average 1.6390684889078169) internal successors, (84671), 51666 states have internal predecessors, (84671), 10236 states have call successors, (10236), 21 states have call predecessors, (10236), 25 states have return successors, (11381), 10234 states have call predecessors, (11381), 10235 states have call successors, (11381) [2025-02-05 15:42:04,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61920 states to 61920 states and 106288 transitions. [2025-02-05 15:42:04,357 INFO L78 Accepts]: Start accepts. Automaton has 61920 states and 106288 transitions. Word has length 125 [2025-02-05 15:42:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:04,358 INFO L471 AbstractCegarLoop]: Abstraction has 61920 states and 106288 transitions. [2025-02-05 15:42:04,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:42:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 61920 states and 106288 transitions. [2025-02-05 15:42:04,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 15:42:04,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:04,396 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:04,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:42:04,396 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:04,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:04,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1214119410, now seen corresponding path program 1 times [2025-02-05 15:42:04,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:04,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361448341] [2025-02-05 15:42:04,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:04,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:04,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 15:42:04,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 15:42:04,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:04,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:04,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:04,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361448341] [2025-02-05 15:42:04,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361448341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:04,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:04,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:04,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669411885] [2025-02-05 15:42:04,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:04,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:04,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:04,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:04,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:04,475 INFO L87 Difference]: Start difference. First operand 61920 states and 106288 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:42:06,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:06,845 INFO L93 Difference]: Finished difference Result 115945 states and 199484 transitions. [2025-02-05 15:42:06,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:06,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2025-02-05 15:42:06,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:07,501 INFO L225 Difference]: With dead ends: 115945 [2025-02-05 15:42:07,502 INFO L226 Difference]: Without dead ends: 115768 [2025-02-05 15:42:07,562 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:42:07,563 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 111 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1138 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:42:07,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1138 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:07,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115768 states. [2025-02-05 15:42:10,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115768 to 115760. [2025-02-05 15:42:10,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115760 states, 97130 states have (on average 1.6341912900236797) internal successors, (158729), 97138 states have internal predecessors, (158729), 18604 states have call successors, (18604), 21 states have call predecessors, (18604), 25 states have return successors, (20795), 18602 states have call predecessors, (20795), 18603 states have call successors, (20795) [2025-02-05 15:42:11,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115760 states to 115760 states and 198128 transitions. [2025-02-05 15:42:11,416 INFO L78 Accepts]: Start accepts. Automaton has 115760 states and 198128 transitions. Word has length 126 [2025-02-05 15:42:11,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:11,417 INFO L471 AbstractCegarLoop]: Abstraction has 115760 states and 198128 transitions. [2025-02-05 15:42:11,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:42:11,417 INFO L276 IsEmpty]: Start isEmpty. Operand 115760 states and 198128 transitions. [2025-02-05 15:42:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:42:11,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:11,458 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:11,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:42:11,458 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:11,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:11,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1822017294, now seen corresponding path program 1 times [2025-02-05 15:42:11,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:11,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761125749] [2025-02-05 15:42:11,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:11,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:11,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:42:11,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:42:11,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:11,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:11,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:11,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761125749] [2025-02-05 15:42:11,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761125749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:11,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:11,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 15:42:11,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692245433] [2025-02-05 15:42:11,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:11,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 15:42:11,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:11,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 15:42:11,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:42:11,770 INFO L87 Difference]: Start difference. First operand 115760 states and 198128 transitions. Second operand has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-02-05 15:42:18,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:18,487 INFO L93 Difference]: Finished difference Result 230640 states and 400232 transitions. [2025-02-05 15:42:18,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 15:42:18,488 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 127 [2025-02-05 15:42:18,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:19,784 INFO L225 Difference]: With dead ends: 230640 [2025-02-05 15:42:19,784 INFO L226 Difference]: Without dead ends: 230469 [2025-02-05 15:42:19,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2025-02-05 15:42:19,891 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 1410 mSDsluCounter, 5815 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1410 SdHoareTripleChecker+Valid, 6504 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:19,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1410 Valid, 6504 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 15:42:20,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230469 states.