./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec1_product21.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-e2fb8be-m [2025-03-08 05:31:10,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:31:10,805 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:31:10,809 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:31:10,809 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:31:10,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:31:10,835 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:31:10,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:31:10,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:31:10,836 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:31:10,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:31:10,836 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:31:10,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:31:10,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:31:10,837 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:31:10,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:31:10,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:31:10,838 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:31:10,838 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:31:10,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:31:10,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:31:10,838 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:31:10,838 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:31:10,838 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:31:10,838 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:31:10,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:31:10,838 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:31:10,838 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:31:10,839 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:31:10,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:31:10,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:31:10,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:31:10,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:31:10,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:31:10,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:31:10,840 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:31:10,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:31:10,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:31:10,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:31:10,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:31:10,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:31:10,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:31:10,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:31:10,840 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/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-03-08 05:31:11,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:31:11,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:31:11,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:31:11,079 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:31:11,080 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:31:11,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec1_product21.cil.c [2025-03-08 05:31:12,277 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/729cda7a0/b57e54c5c4fc47128a37ef732dc91e8d/FLAGe987c9cd9 [2025-03-08 05:31:12,592 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:31:12,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product21.cil.c [2025-03-08 05:31:12,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/729cda7a0/b57e54c5c4fc47128a37ef732dc91e8d/FLAGe987c9cd9 [2025-03-08 05:31:12,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/729cda7a0/b57e54c5c4fc47128a37ef732dc91e8d [2025-03-08 05:31:12,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:31:12,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:31:12,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:31:12,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:31:12,850 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:31:12,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:31:12" (1/1) ... [2025-03-08 05:31:12,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ab434f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:12, skipping insertion in model container [2025-03-08 05:31:12,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:31:12" (1/1) ... [2025-03-08 05:31:12,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:31:13,225 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product21.cil.c[63391,63404] [2025-03-08 05:31:13,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:31:13,239 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:31:13,244 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [48] [2025-03-08 05:31:13,245 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [90] [2025-03-08 05:31:13,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [501] [2025-03-08 05:31:13,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [730] [2025-03-08 05:31:13,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [836] [2025-03-08 05:31:13,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [853] [2025-03-08 05:31:13,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1219] [2025-03-08 05:31:13,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1257] [2025-03-08 05:31:13,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1577] [2025-03-08 05:31:13,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2649] [2025-03-08 05:31:13,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2937] [2025-03-08 05:31:13,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product21.cil.c[63391,63404] [2025-03-08 05:31:13,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:31:13,381 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:31:13,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:13 WrapperNode [2025-03-08 05:31:13,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:31:13,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:31:13,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:31:13,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:31:13,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:13" (1/1) ... [2025-03-08 05:31:13,411 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:13" (1/1) ... [2025-03-08 05:31:13,466 INFO L138 Inliner]: procedures = 128, calls = 197, calls flagged for inlining = 57, calls inlined = 54, statements flattened = 1060 [2025-03-08 05:31:13,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:31:13,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:31:13,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:31:13,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:31:13,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:13" (1/1) ... [2025-03-08 05:31:13,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:13" (1/1) ... [2025-03-08 05:31:13,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:13" (1/1) ... [2025-03-08 05:31:13,506 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-03-08 05:31:13,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:13" (1/1) ... [2025-03-08 05:31:13,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:13" (1/1) ... [2025-03-08 05:31:13,525 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:13" (1/1) ... [2025-03-08 05:31:13,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:13" (1/1) ... [2025-03-08 05:31:13,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:13" (1/1) ... [2025-03-08 05:31:13,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:13" (1/1) ... [2025-03-08 05:31:13,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:31:13,541 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:31:13,541 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:31:13,541 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:31:13,542 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:13" (1/1) ... [2025-03-08 05:31:13,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:31:13,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:13,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:31:13,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:31:13,589 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-08 05:31:13,589 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-08 05:31:13,589 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:31:13,589 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:31:13,589 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-08 05:31:13,589 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-08 05:31:13,589 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:31:13,589 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:31:13,589 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:31:13,589 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:31:13,589 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:31:13,589 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:31:13,589 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:31:13,589 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:31:13,589 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:31:13,589 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:31:13,589 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:31:13,589 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:31:13,589 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:31:13,589 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:31:13,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:31:13,589 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-08 05:31:13,590 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-08 05:31:13,590 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:31:13,590 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:31:13,590 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:31:13,590 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:31:13,590 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:31:13,590 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:31:13,590 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2025-03-08 05:31:13,590 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2025-03-08 05:31:13,590 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:31:13,590 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:31:13,591 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:31:13,591 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:31:13,591 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:31:13,591 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:31:13,591 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:31:13,591 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:31:13,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:31:13,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:31:13,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:31:13,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:31:13,591 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:31:13,591 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:31:13,591 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-08 05:31:13,591 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-08 05:31:13,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:31:13,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:31:13,757 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:31:13,760 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:31:13,863 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2238-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~36#1; [2025-03-08 05:31:13,863 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2283: #res#1 := ~retValue_acc~37#1; [2025-03-08 05:31:14,102 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2579-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~41#1; [2025-03-08 05:31:14,102 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2191-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~35#1; [2025-03-08 05:31:14,102 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L789-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~11#1; [2025-03-08 05:31:14,102 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L145-1: getEmailId_#res#1 := getEmailId_~retValue_acc~1#1; [2025-03-08 05:31:14,102 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2507-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~40#1; [2025-03-08 05:31:14,102 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L809-1: isReadable_#res#1 := isReadable_~retValue_acc~12#1; [2025-03-08 05:31:14,102 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2626-1: getClientId_#res#1 := getClientId_~retValue_acc~42#1; [2025-03-08 05:31:14,102 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L182-1: getEmailFrom_#res#1 := getEmailFrom_~retValue_acc~2#1; [2025-03-08 05:31:14,102 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1545-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~25#1; [2025-03-08 05:31:14,115 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L833-1: createEmail_#res#1 := createEmail_~retValue_acc~14#1; [2025-03-08 05:31:14,128 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1735: #res := ~retValue_acc~29; [2025-03-08 05:31:14,137 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L334: #res := ~retValue_acc~6; [2025-03-08 05:31:14,169 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L371: #res := ~retValue_acc~7; [2025-03-08 05:31:14,189 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L219: #res := ~retValue_acc~3; [2025-03-08 05:31:14,230 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2061: #res := ~retValue_acc~33; [2025-03-08 05:31:14,462 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1511-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~23#1; [2025-03-08 05:31:14,462 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~39#1; [2025-03-08 05:31:14,462 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1254-1: valid_product_#res#1 := valid_product_~retValue_acc~20#1; [2025-03-08 05:31:14,462 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1502-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~22#1; [2025-03-08 05:31:14,462 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1520-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~24#1; [2025-03-08 05:31:14,462 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2346-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~38#1; [2025-03-08 05:31:14,603 INFO L? ?]: Removed 521 outVars from TransFormulas that were not future-live. [2025-03-08 05:31:14,606 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:31:14,624 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:31:14,624 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:31:14,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:31:14 BoogieIcfgContainer [2025-03-08 05:31:14,625 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:31:14,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:31:14,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:31:14,630 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:31:14,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:31:12" (1/3) ... [2025-03-08 05:31:14,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e462afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:31:14, skipping insertion in model container [2025-03-08 05:31:14,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:13" (2/3) ... [2025-03-08 05:31:14,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e462afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:31:14, skipping insertion in model container [2025-03-08 05:31:14,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:31:14" (3/3) ... [2025-03-08 05:31:14,632 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec1_product21.cil.c [2025-03-08 05:31:14,643 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:31:14,648 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec1_product21.cil.c that has 22 procedures, 374 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:31:14,714 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:31:14,723 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;@7c59d7d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:31:14,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:31:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand has 374 states, 294 states have (on average 1.5714285714285714) internal successors, (462), 299 states have internal predecessors, (462), 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-03-08 05:31:14,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 05:31:14,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:14,747 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:14,748 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:14,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:14,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1280164413, now seen corresponding path program 1 times [2025-03-08 05:31:14,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:14,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531217472] [2025-03-08 05:31:14,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:14,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:14,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 05:31:14,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 05:31:14,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:14,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:31:15,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:15,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531217472] [2025-03-08 05:31:15,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531217472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:31:15,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031199487] [2025-03-08 05:31:15,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:15,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:15,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:15,314 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:31:15,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:31:15,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 05:31:15,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 05:31:15,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:15,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:15,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:31:15,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:31:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:31:15,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:31:15,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031199487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:15,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:31:15,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:31:15,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722327288] [2025-03-08 05:31:15,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:15,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:15,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:15,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:15,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:31:15,656 INFO L87 Difference]: Start difference. First operand has 374 states, 294 states have (on average 1.5714285714285714) internal successors, (462), 299 states have internal predecessors, (462), 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 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:15,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:15,712 INFO L93 Difference]: Finished difference Result 558 states and 848 transitions. [2025-03-08 05:31:15,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:15,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2025-03-08 05:31:15,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:15,726 INFO L225 Difference]: With dead ends: 558 [2025-03-08 05:31:15,728 INFO L226 Difference]: Without dead ends: 368 [2025-03-08 05:31:15,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:31:15,734 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 0 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1141 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-03-08 05:31:15,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1141 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:15,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-08 05:31:15,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-03-08 05:31:15,787 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-03-08 05:31:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 566 transitions. [2025-03-08 05:31:15,803 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 566 transitions. Word has length 98 [2025-03-08 05:31:15,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:15,804 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 566 transitions. [2025-03-08 05:31:15,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:15,805 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 566 transitions. [2025-03-08 05:31:15,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 05:31:15,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:15,811 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:15,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:31:16,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:31:16,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:16,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:16,015 INFO L85 PathProgramCache]: Analyzing trace with hash -765064693, now seen corresponding path program 1 times [2025-03-08 05:31:16,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:16,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298876734] [2025-03-08 05:31:16,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:16,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:16,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:31:16,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:31:16,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:16,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:31:16,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:16,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298876734] [2025-03-08 05:31:16,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298876734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:31:16,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496780196] [2025-03-08 05:31:16,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:16,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:16,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:16,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:31:16,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:31:16,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:31:16,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:31:16,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:16,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:16,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:31:16,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:31:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:31:16,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:31:16,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496780196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:16,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:31:16,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:31:16,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295307449] [2025-03-08 05:31:16,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:16,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:16,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:16,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:16,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:31:16,545 INFO L87 Difference]: Start difference. First operand 368 states and 566 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-03-08 05:31:16,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:16,587 INFO L93 Difference]: Finished difference Result 783 states and 1223 transitions. [2025-03-08 05:31:16,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:16,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 102 [2025-03-08 05:31:16,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:16,594 INFO L225 Difference]: With dead ends: 783 [2025-03-08 05:31:16,596 INFO L226 Difference]: Without dead ends: 441 [2025-03-08 05:31:16,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 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-03-08 05:31:16,598 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 134 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1107 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-03-08 05:31:16,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1107 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:16,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-08 05:31:16,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 433. [2025-03-08 05:31:16,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 340 states have (on average 1.588235294117647) internal successors, (540), 344 states have internal predecessors, (540), 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-03-08 05:31:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 681 transitions. [2025-03-08 05:31:16,641 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 681 transitions. Word has length 102 [2025-03-08 05:31:16,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:16,642 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 681 transitions. [2025-03-08 05:31:16,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-03-08 05:31:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 681 transitions. [2025-03-08 05:31:16,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:31:16,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:16,648 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:16,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:31:16,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 05:31:16,852 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:16,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:16,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1445585133, now seen corresponding path program 1 times [2025-03-08 05:31:16,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:16,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500562273] [2025-03-08 05:31:16,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:16,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:16,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:31:16,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:31:16,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:16,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:17,045 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:31:17,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:17,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500562273] [2025-03-08 05:31:17,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500562273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:31:17,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570035594] [2025-03-08 05:31:17,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:17,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:17,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:17,049 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:31:17,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:31:17,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:31:17,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:31:17,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:17,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:17,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:31:17,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:31:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:31:17,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:31:17,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570035594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:17,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:31:17,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:31:17,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396868521] [2025-03-08 05:31:17,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:17,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:31:17,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:17,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:31:17,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:31:17,332 INFO L87 Difference]: Start difference. First operand 433 states and 681 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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-03-08 05:31:17,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:17,403 INFO L93 Difference]: Finished difference Result 857 states and 1352 transitions. [2025-03-08 05:31:17,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:31:17,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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 103 [2025-03-08 05:31:17,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:17,409 INFO L225 Difference]: With dead ends: 857 [2025-03-08 05:31:17,409 INFO L226 Difference]: Without dead ends: 435 [2025-03-08 05:31:17,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 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-03-08 05:31:17,413 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 2 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2217 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-03-08 05:31:17,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2217 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-03-08 05:31:17,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2025-03-08 05:31:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 341 states have (on average 1.5865102639296187) internal successors, (541), 346 states have internal predecessors, (541), 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-03-08 05:31:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 684 transitions. [2025-03-08 05:31:17,429 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 684 transitions. Word has length 103 [2025-03-08 05:31:17,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:17,429 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 684 transitions. [2025-03-08 05:31:17,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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-03-08 05:31:17,430 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 684 transitions. [2025-03-08 05:31:17,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 05:31:17,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:17,431 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:17,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:31:17,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:17,632 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:17,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:17,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1597671344, now seen corresponding path program 1 times [2025-03-08 05:31:17,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:17,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482260676] [2025-03-08 05:31:17,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:17,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:17,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:31:17,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:31:17,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:17,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:31:17,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:17,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482260676] [2025-03-08 05:31:17,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482260676] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:31:17,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771839016] [2025-03-08 05:31:17,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:17,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:17,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:17,794 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:31:17,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:31:17,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:31:18,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:31:18,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:18,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:18,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 1008 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:31:18,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:31:18,086 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:31:18,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:31:18,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771839016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:18,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:31:18,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:31:18,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146403454] [2025-03-08 05:31:18,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:18,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:31:18,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:18,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:31:18,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:31:18,088 INFO L87 Difference]: Start difference. First operand 435 states and 684 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:31:18,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:18,139 INFO L93 Difference]: Finished difference Result 859 states and 1357 transitions. [2025-03-08 05:31:18,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:31:18,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2025-03-08 05:31:18,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:18,142 INFO L225 Difference]: With dead ends: 859 [2025-03-08 05:31:18,143 INFO L226 Difference]: Without dead ends: 437 [2025-03-08 05:31:18,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:31:18,145 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 2 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2203 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-03-08 05:31:18,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2203 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-08 05:31:18,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2025-03-08 05:31:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 342 states have (on average 1.5847953216374269) internal successors, (542), 348 states have internal predecessors, (542), 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-03-08 05:31:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 690 transitions. [2025-03-08 05:31:18,167 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 690 transitions. Word has length 104 [2025-03-08 05:31:18,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:18,167 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 690 transitions. [2025-03-08 05:31:18,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:31:18,167 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 690 transitions. [2025-03-08 05:31:18,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 05:31:18,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:18,170 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] [2025-03-08 05:31:18,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:31:18,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:18,371 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:18,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:18,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1177382121, now seen corresponding path program 1 times [2025-03-08 05:31:18,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:18,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567983225] [2025-03-08 05:31:18,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:18,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:18,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 05:31:18,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 05:31:18,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:18,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:31:18,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:18,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567983225] [2025-03-08 05:31:18,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567983225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:18,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:18,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:31:18,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314491724] [2025-03-08 05:31:18,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:18,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:31:18,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:18,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:31:18,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:31:18,498 INFO L87 Difference]: Start difference. First operand 437 states and 690 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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-03-08 05:31:18,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:18,530 INFO L93 Difference]: Finished difference Result 851 states and 1348 transitions. [2025-03-08 05:31:18,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:31:18,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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 105 [2025-03-08 05:31:18,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:18,534 INFO L225 Difference]: With dead ends: 851 [2025-03-08 05:31:18,534 INFO L226 Difference]: Without dead ends: 437 [2025-03-08 05:31:18,535 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-03-08 05:31:18,535 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 2 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2221 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-03-08 05:31:18,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2221 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:18,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-08 05:31:18,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2025-03-08 05:31:18,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 342 states have (on average 1.5847953216374269) internal successors, (542), 348 states have internal predecessors, (542), 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-03-08 05:31:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 689 transitions. [2025-03-08 05:31:18,549 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 689 transitions. Word has length 105 [2025-03-08 05:31:18,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:18,549 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 689 transitions. [2025-03-08 05:31:18,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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-03-08 05:31:18,550 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 689 transitions. [2025-03-08 05:31:18,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 05:31:18,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:18,553 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] [2025-03-08 05:31:18,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:31:18,553 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:18,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:18,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1987798692, now seen corresponding path program 2 times [2025-03-08 05:31:18,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:18,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478125028] [2025-03-08 05:31:18,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:31:18,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:18,569 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 106 statements into 2 equivalence classes. [2025-03-08 05:31:18,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 05:31:18,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:31:18,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:31:18,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:18,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478125028] [2025-03-08 05:31:18,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478125028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:18,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:18,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:31:18,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057095161] [2025-03-08 05:31:18,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:18,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:31:18,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:18,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:31:18,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:31:18,673 INFO L87 Difference]: Start difference. First operand 437 states and 689 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-03-08 05:31:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:18,717 INFO L93 Difference]: Finished difference Result 849 states and 1343 transitions. [2025-03-08 05:31:18,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:31:18,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 106 [2025-03-08 05:31:18,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:18,720 INFO L225 Difference]: With dead ends: 849 [2025-03-08 05:31:18,721 INFO L226 Difference]: Without dead ends: 437 [2025-03-08 05:31:18,722 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-03-08 05:31:18,723 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 2 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2207 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-03-08 05:31:18,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2207 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:18,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-08 05:31:18,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2025-03-08 05:31:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 342 states have (on average 1.5847953216374269) internal successors, (542), 348 states have internal predecessors, (542), 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-03-08 05:31:18,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 688 transitions. [2025-03-08 05:31:18,749 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 688 transitions. Word has length 106 [2025-03-08 05:31:18,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:18,750 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 688 transitions. [2025-03-08 05:31:18,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-03-08 05:31:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 688 transitions. [2025-03-08 05:31:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 05:31:18,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:18,753 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] [2025-03-08 05:31:18,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:31:18,753 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:18,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:18,754 INFO L85 PathProgramCache]: Analyzing trace with hash 981026501, now seen corresponding path program 3 times [2025-03-08 05:31:18,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:18,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815971945] [2025-03-08 05:31:18,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:31:18,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:18,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 107 statements into 3 equivalence classes. [2025-03-08 05:31:18,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 95 of 107 statements. [2025-03-08 05:31:18,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 05:31:18,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:18,870 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:31:18,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:18,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815971945] [2025-03-08 05:31:18,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815971945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:18,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:18,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:31:18,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566789516] [2025-03-08 05:31:18,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:18,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:31:18,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:18,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:31:18,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:31:18,872 INFO L87 Difference]: Start difference. First operand 437 states and 688 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-03-08 05:31:18,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:18,914 INFO L93 Difference]: Finished difference Result 851 states and 1349 transitions. [2025-03-08 05:31:18,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:31:18,915 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 107 [2025-03-08 05:31:18,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:18,917 INFO L225 Difference]: With dead ends: 851 [2025-03-08 05:31:18,917 INFO L226 Difference]: Without dead ends: 439 [2025-03-08 05:31:18,919 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-03-08 05:31:18,919 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 1 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2218 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-03-08 05:31:18,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2218 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:18,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-08 05:31:18,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2025-03-08 05:31:18,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 343 states have (on average 1.5830903790087463) internal successors, (543), 350 states have internal predecessors, (543), 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-03-08 05:31:18,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 694 transitions. [2025-03-08 05:31:18,932 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 694 transitions. Word has length 107 [2025-03-08 05:31:18,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:18,933 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 694 transitions. [2025-03-08 05:31:18,933 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-03-08 05:31:18,933 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 694 transitions. [2025-03-08 05:31:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 05:31:18,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:18,934 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] [2025-03-08 05:31:18,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:31:18,935 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:18,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:18,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1866081856, now seen corresponding path program 1 times [2025-03-08 05:31:18,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:18,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650254076] [2025-03-08 05:31:18,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:18,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:18,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:31:18,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:31:18,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:18,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:19,036 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:31:19,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:19,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650254076] [2025-03-08 05:31:19,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650254076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:19,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:19,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:31:19,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233254836] [2025-03-08 05:31:19,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:19,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:31:19,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:19,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:31:19,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:31:19,038 INFO L87 Difference]: Start difference. First operand 439 states and 694 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), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:31:19,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:19,075 INFO L93 Difference]: Finished difference Result 857 states and 1359 transitions. [2025-03-08 05:31:19,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:31:19,075 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), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-03-08 05:31:19,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:19,078 INFO L225 Difference]: With dead ends: 857 [2025-03-08 05:31:19,078 INFO L226 Difference]: Without dead ends: 441 [2025-03-08 05:31:19,080 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-03-08 05:31:19,080 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 1 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2224 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-03-08 05:31:19,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2224 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:19,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-08 05:31:19,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2025-03-08 05:31:19,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 344 states have (on average 1.5813953488372092) internal successors, (544), 352 states have internal predecessors, (544), 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-03-08 05:31:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 697 transitions. [2025-03-08 05:31:19,095 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 697 transitions. Word has length 108 [2025-03-08 05:31:19,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:19,095 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 697 transitions. [2025-03-08 05:31:19,096 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), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:31:19,096 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 697 transitions. [2025-03-08 05:31:19,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:31:19,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:19,098 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:19,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:31:19,098 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:19,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:19,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1085558114, now seen corresponding path program 1 times [2025-03-08 05:31:19,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:19,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412634084] [2025-03-08 05:31:19,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:19,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:19,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:31:19,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:31:19,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:19,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:19,175 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:31:19,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:19,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412634084] [2025-03-08 05:31:19,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412634084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:19,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:19,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:31:19,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662778558] [2025-03-08 05:31:19,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:19,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:31:19,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:19,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:31:19,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:31:19,176 INFO L87 Difference]: Start difference. First operand 441 states and 697 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:31:19,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:19,222 INFO L93 Difference]: Finished difference Result 857 states and 1362 transitions. [2025-03-08 05:31:19,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:31:19,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2025-03-08 05:31:19,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:19,225 INFO L225 Difference]: With dead ends: 857 [2025-03-08 05:31:19,225 INFO L226 Difference]: Without dead ends: 443 [2025-03-08 05:31:19,226 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-03-08 05:31:19,227 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 0 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2203 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-03-08 05:31:19,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2203 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:19,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-08 05:31:19,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2025-03-08 05:31:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 344 states have (on average 1.5813953488372092) internal successors, (544), 352 states have internal predecessors, (544), 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-03-08 05:31:19,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 697 transitions. [2025-03-08 05:31:19,256 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 697 transitions. Word has length 109 [2025-03-08 05:31:19,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:19,256 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 697 transitions. [2025-03-08 05:31:19,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:31:19,257 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 697 transitions. [2025-03-08 05:31:19,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:31:19,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:19,260 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:19,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:31:19,260 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:19,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:19,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1905015453, now seen corresponding path program 1 times [2025-03-08 05:31:19,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:19,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18443153] [2025-03-08 05:31:19,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:19,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:19,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:31:19,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:31:19,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:19,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:19,363 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:19,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:19,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18443153] [2025-03-08 05:31:19,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18443153] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:31:19,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940182845] [2025-03-08 05:31:19,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:19,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:19,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:19,367 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:31:19,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:31:19,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:31:19,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:31:19,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:19,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:19,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:31:19,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:31:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:19,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:31:19,663 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:19,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940182845] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:31:19,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:31:19,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 05:31:19,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237131015] [2025-03-08 05:31:19,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:31:19,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:31:19,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:19,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:31:19,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:31:19,665 INFO L87 Difference]: Start difference. First operand 441 states and 697 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 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-03-08 05:31:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:19,797 INFO L93 Difference]: Finished difference Result 1049 states and 1715 transitions. [2025-03-08 05:31:19,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:31:19,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 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 109 [2025-03-08 05:31:19,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:19,803 INFO L225 Difference]: With dead ends: 1049 [2025-03-08 05:31:19,803 INFO L226 Difference]: Without dead ends: 872 [2025-03-08 05:31:19,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 215 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-03-08 05:31:19,805 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 763 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:19,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 2007 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:31:19,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-08 05:31:19,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 848. [2025-03-08 05:31:19,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 672 states have (on average 1.6458333333333333) internal successors, (1106), 680 states have internal predecessors, (1106), 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-03-08 05:31:19,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1427 transitions. [2025-03-08 05:31:19,836 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1427 transitions. Word has length 109 [2025-03-08 05:31:19,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:19,836 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1427 transitions. [2025-03-08 05:31:19,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 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-03-08 05:31:19,837 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1427 transitions. [2025-03-08 05:31:19,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:31:19,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:19,840 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] [2025-03-08 05:31:19,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 05:31:20,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 05:31:20,041 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:20,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:20,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1545036366, now seen corresponding path program 1 times [2025-03-08 05:31:20,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:20,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305645966] [2025-03-08 05:31:20,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:20,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:20,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:31:20,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:31:20,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:20,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:20,084 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:20,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:20,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305645966] [2025-03-08 05:31:20,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305645966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:20,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:20,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:20,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757664947] [2025-03-08 05:31:20,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:20,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:20,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:20,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:20,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:20,085 INFO L87 Difference]: Start difference. First operand 848 states and 1427 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (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-03-08 05:31:20,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:20,115 INFO L93 Difference]: Finished difference Result 2043 states and 3483 transitions. [2025-03-08 05:31:20,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:20,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (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 116 [2025-03-08 05:31:20,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:20,122 INFO L225 Difference]: With dead ends: 2043 [2025-03-08 05:31:20,122 INFO L226 Difference]: Without dead ends: 1259 [2025-03-08 05:31:20,125 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-03-08 05:31:20,126 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 132 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1134 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-03-08 05:31:20,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1134 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:20,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2025-03-08 05:31:20,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1251. [2025-03-08 05:31:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 996 states have (on average 1.6606425702811245) internal successors, (1654), 1004 states have internal predecessors, (1654), 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-03-08 05:31:20,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 2143 transitions. [2025-03-08 05:31:20,169 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 2143 transitions. Word has length 116 [2025-03-08 05:31:20,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:20,170 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 2143 transitions. [2025-03-08 05:31:20,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (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-03-08 05:31:20,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 2143 transitions. [2025-03-08 05:31:20,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 05:31:20,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:20,176 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-03-08 05:31:20,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:31:20,176 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:20,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:20,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1903205935, now seen corresponding path program 1 times [2025-03-08 05:31:20,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:20,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238683660] [2025-03-08 05:31:20,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:20,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:20,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:31:20,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:31:20,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:20,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:20,241 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:20,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:20,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238683660] [2025-03-08 05:31:20,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238683660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:20,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:20,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:20,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965336158] [2025-03-08 05:31:20,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:20,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:20,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:20,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:20,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:20,242 INFO L87 Difference]: Start difference. First operand 1251 states and 2143 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-03-08 05:31:20,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:20,299 INFO L93 Difference]: Finished difference Result 3029 states and 5217 transitions. [2025-03-08 05:31:20,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:20,300 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-03-08 05:31:20,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:20,311 INFO L225 Difference]: With dead ends: 3029 [2025-03-08 05:31:20,311 INFO L226 Difference]: Without dead ends: 1891 [2025-03-08 05:31:20,316 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-03-08 05:31:20,316 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 130 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 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-03-08 05:31:20,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:20,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2025-03-08 05:31:20,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1883. [2025-03-08 05:31:20,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1509 states have (on average 1.6706428098078197) internal successors, (2521), 1517 states have internal predecessors, (2521), 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-03-08 05:31:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 3248 transitions. [2025-03-08 05:31:20,407 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 3248 transitions. Word has length 117 [2025-03-08 05:31:20,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:20,408 INFO L471 AbstractCegarLoop]: Abstraction has 1883 states and 3248 transitions. [2025-03-08 05:31:20,408 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-03-08 05:31:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 3248 transitions. [2025-03-08 05:31:20,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:31:20,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:20,418 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-03-08 05:31:20,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:31:20,418 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:20,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:20,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1885772525, now seen corresponding path program 1 times [2025-03-08 05:31:20,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:20,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986069011] [2025-03-08 05:31:20,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:20,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:20,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:31:20,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:31:20,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:20,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:20,467 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:20,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:20,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986069011] [2025-03-08 05:31:20,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986069011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:20,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:20,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:20,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593236722] [2025-03-08 05:31:20,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:20,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:20,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:20,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:20,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:20,468 INFO L87 Difference]: Start difference. First operand 1883 states and 3248 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-03-08 05:31:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:20,535 INFO L93 Difference]: Finished difference Result 4513 states and 7839 transitions. [2025-03-08 05:31:20,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:20,536 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-03-08 05:31:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:20,550 INFO L225 Difference]: With dead ends: 4513 [2025-03-08 05:31:20,551 INFO L226 Difference]: Without dead ends: 2861 [2025-03-08 05:31:20,557 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-03-08 05:31:20,557 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 128 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1119 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-03-08 05:31:20,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1119 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:20,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2025-03-08 05:31:20,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 2853. [2025-03-08 05:31:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2317 states have (on average 1.6788951230038844) internal successors, (3890), 2325 states have internal predecessors, (3890), 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-03-08 05:31:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4957 transitions. [2025-03-08 05:31:20,661 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4957 transitions. Word has length 118 [2025-03-08 05:31:20,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:20,662 INFO L471 AbstractCegarLoop]: Abstraction has 2853 states and 4957 transitions. [2025-03-08 05:31:20,662 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-03-08 05:31:20,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4957 transitions. [2025-03-08 05:31:20,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 05:31:20,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:20,674 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-03-08 05:31:20,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:31:20,674 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:20,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:20,675 INFO L85 PathProgramCache]: Analyzing trace with hash -43846958, now seen corresponding path program 1 times [2025-03-08 05:31:20,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:20,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746431833] [2025-03-08 05:31:20,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:20,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:20,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 05:31:20,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:31:20,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:20,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:20,746 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:20,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:20,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746431833] [2025-03-08 05:31:20,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746431833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:20,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:20,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:20,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857722747] [2025-03-08 05:31:20,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:20,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:20,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:20,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:20,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:20,748 INFO L87 Difference]: Start difference. First operand 2853 states and 4957 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-03-08 05:31:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:20,845 INFO L93 Difference]: Finished difference Result 6860 states and 11994 transitions. [2025-03-08 05:31:20,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:20,846 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-03-08 05:31:20,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:20,870 INFO L225 Difference]: With dead ends: 6860 [2025-03-08 05:31:20,871 INFO L226 Difference]: Without dead ends: 4431 [2025-03-08 05:31:20,881 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-03-08 05:31:20,881 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 126 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1119 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-03-08 05:31:20,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1119 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:20,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4431 states. [2025-03-08 05:31:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4431 to 4423. [2025-03-08 05:31:21,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4423 states, 3642 states have (on average 1.684788577704558) internal successors, (6136), 3650 states have internal predecessors, (6136), 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-03-08 05:31:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4423 states to 4423 states and 7719 transitions. [2025-03-08 05:31:21,054 INFO L78 Accepts]: Start accepts. Automaton has 4423 states and 7719 transitions. Word has length 119 [2025-03-08 05:31:21,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:21,054 INFO L471 AbstractCegarLoop]: Abstraction has 4423 states and 7719 transitions. [2025-03-08 05:31:21,055 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-03-08 05:31:21,055 INFO L276 IsEmpty]: Start isEmpty. Operand 4423 states and 7719 transitions. [2025-03-08 05:31:21,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 05:31:21,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:21,070 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-03-08 05:31:21,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:31:21,070 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:21,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:21,070 INFO L85 PathProgramCache]: Analyzing trace with hash -405525332, now seen corresponding path program 1 times [2025-03-08 05:31:21,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:21,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498844623] [2025-03-08 05:31:21,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:21,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:21,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 05:31:21,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 05:31:21,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:21,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:21,114 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:21,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:21,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498844623] [2025-03-08 05:31:21,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498844623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:21,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:21,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:21,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271810941] [2025-03-08 05:31:21,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:21,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:21,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:21,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:21,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:21,116 INFO L87 Difference]: Start difference. First operand 4423 states and 7719 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-03-08 05:31:21,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:21,300 INFO L93 Difference]: Finished difference Result 10773 states and 18921 transitions. [2025-03-08 05:31:21,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:21,301 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-03-08 05:31:21,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:21,337 INFO L225 Difference]: With dead ends: 10773 [2025-03-08 05:31:21,337 INFO L226 Difference]: Without dead ends: 7070 [2025-03-08 05:31:21,351 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-03-08 05:31:21,351 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 124 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1130 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-03-08 05:31:21,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7070 states. [2025-03-08 05:31:21,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7070 to 7062. [2025-03-08 05:31:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7062 states, 5788 states have (on average 1.6840013821700068) internal successors, (9747), 5796 states have internal predecessors, (9747), 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-03-08 05:31:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7062 states to 7062 states and 12360 transitions. [2025-03-08 05:31:21,661 INFO L78 Accepts]: Start accepts. Automaton has 7062 states and 12360 transitions. Word has length 120 [2025-03-08 05:31:21,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:21,662 INFO L471 AbstractCegarLoop]: Abstraction has 7062 states and 12360 transitions. [2025-03-08 05:31:21,662 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-03-08 05:31:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 7062 states and 12360 transitions. [2025-03-08 05:31:21,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 05:31:21,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:21,682 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-03-08 05:31:21,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:31:21,682 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:21,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:21,682 INFO L85 PathProgramCache]: Analyzing trace with hash 937531859, now seen corresponding path program 1 times [2025-03-08 05:31:21,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:21,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661983127] [2025-03-08 05:31:21,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:21,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:21,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:31:21,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:31:21,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:21,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:21,727 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:21,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:21,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661983127] [2025-03-08 05:31:21,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661983127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:21,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:21,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:21,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296966653] [2025-03-08 05:31:21,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:21,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:21,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:21,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:21,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:21,733 INFO L87 Difference]: Start difference. First operand 7062 states and 12360 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-03-08 05:31:21,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:21,999 INFO L93 Difference]: Finished difference Result 17870 states and 31456 transitions. [2025-03-08 05:31:21,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:22,000 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-03-08 05:31:22,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:22,056 INFO L225 Difference]: With dead ends: 17870 [2025-03-08 05:31:22,056 INFO L226 Difference]: Without dead ends: 11883 [2025-03-08 05:31:22,078 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-03-08 05:31:22,080 INFO L435 NwaCegarLoop]: 573 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, 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-03-08 05:31:22,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:22,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11883 states. [2025-03-08 05:31:22,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11883 to 11875. [2025-03-08 05:31:22,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11875 states, 9779 states have (on average 1.6843235504652827) internal successors, (16471), 9787 states have internal predecessors, (16471), 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-03-08 05:31:22,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11875 states to 11875 states and 20806 transitions. [2025-03-08 05:31:22,651 INFO L78 Accepts]: Start accepts. Automaton has 11875 states and 20806 transitions. Word has length 121 [2025-03-08 05:31:22,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:22,652 INFO L471 AbstractCegarLoop]: Abstraction has 11875 states and 20806 transitions. [2025-03-08 05:31:22,653 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-03-08 05:31:22,653 INFO L276 IsEmpty]: Start isEmpty. Operand 11875 states and 20806 transitions. [2025-03-08 05:31:22,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 05:31:22,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:22,680 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-03-08 05:31:22,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:31:22,681 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:22,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:22,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1330436235, now seen corresponding path program 1 times [2025-03-08 05:31:22,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:22,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266829867] [2025-03-08 05:31:22,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:22,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:22,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 05:31:22,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 05:31:22,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:22,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:22,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:22,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266829867] [2025-03-08 05:31:22,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266829867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:22,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:22,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:22,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759720485] [2025-03-08 05:31:22,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:22,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:22,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:22,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:22,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:22,779 INFO L87 Difference]: Start difference. First operand 11875 states and 20806 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-03-08 05:31:23,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:23,119 INFO L93 Difference]: Finished difference Result 28388 states and 49700 transitions. [2025-03-08 05:31:23,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:23,121 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-03-08 05:31:23,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:23,261 INFO L225 Difference]: With dead ends: 28388 [2025-03-08 05:31:23,261 INFO L226 Difference]: Without dead ends: 18533 [2025-03-08 05:31:23,289 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-03-08 05:31:23,289 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 120 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1096 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-03-08 05:31:23,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1096 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:23,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18533 states. [2025-03-08 05:31:23,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18533 to 18525. [2025-03-08 05:31:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18525 states, 15226 states have (on average 1.6622881912518062) internal successors, (25310), 15234 states have internal predecessors, (25310), 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-03-08 05:31:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18525 states to 18525 states and 32195 transitions. [2025-03-08 05:31:23,969 INFO L78 Accepts]: Start accepts. Automaton has 18525 states and 32195 transitions. Word has length 122 [2025-03-08 05:31:23,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:23,970 INFO L471 AbstractCegarLoop]: Abstraction has 18525 states and 32195 transitions. [2025-03-08 05:31:23,970 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-03-08 05:31:23,970 INFO L276 IsEmpty]: Start isEmpty. Operand 18525 states and 32195 transitions. [2025-03-08 05:31:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 05:31:23,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:23,997 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-03-08 05:31:23,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:31:23,997 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:23,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:23,998 INFO L85 PathProgramCache]: Analyzing trace with hash 995114068, now seen corresponding path program 1 times [2025-03-08 05:31:23,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:23,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657443] [2025-03-08 05:31:23,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:23,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:24,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 05:31:24,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 05:31:24,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:24,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:24,046 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:24,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:24,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657443] [2025-03-08 05:31:24,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:24,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:24,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:24,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520382816] [2025-03-08 05:31:24,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:24,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:24,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:24,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:24,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:24,049 INFO L87 Difference]: Start difference. First operand 18525 states and 32195 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-03-08 05:31:24,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:24,905 INFO L93 Difference]: Finished difference Result 48985 states and 85445 transitions. [2025-03-08 05:31:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:24,905 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-03-08 05:31:24,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:25,059 INFO L225 Difference]: With dead ends: 48985 [2025-03-08 05:31:25,060 INFO L226 Difference]: Without dead ends: 33085 [2025-03-08 05:31:25,124 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-03-08 05:31:25,126 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 118 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1122 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-03-08 05:31:25,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1122 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:25,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33085 states. [2025-03-08 05:31:26,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33085 to 33077. [2025-03-08 05:31:26,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33077 states, 27328 states have (on average 1.6592505854800936) internal successors, (45344), 27336 states have internal predecessors, (45344), 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-03-08 05:31:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33077 states to 33077 states and 57403 transitions. [2025-03-08 05:31:26,335 INFO L78 Accepts]: Start accepts. Automaton has 33077 states and 57403 transitions. Word has length 123 [2025-03-08 05:31:26,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:26,335 INFO L471 AbstractCegarLoop]: Abstraction has 33077 states and 57403 transitions. [2025-03-08 05:31:26,335 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-03-08 05:31:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 33077 states and 57403 transitions. [2025-03-08 05:31:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 05:31:26,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:26,475 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2025-03-08 05:31:26,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:31:26,475 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:26,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:26,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1168223597, now seen corresponding path program 2 times [2025-03-08 05:31:26,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:26,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032972414] [2025-03-08 05:31:26,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:31:26,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:26,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 124 statements into 2 equivalence classes. [2025-03-08 05:31:26,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:31:26,504 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:31:26,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:26,572 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 05:31:26,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:26,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032972414] [2025-03-08 05:31:26,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032972414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:26,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:26,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:31:26,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641302833] [2025-03-08 05:31:26,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:26,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:31:26,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:26,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:31:26,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:31:26,574 INFO L87 Difference]: Start difference. First operand 33077 states and 57403 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 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-03-08 05:31:27,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:27,283 INFO L93 Difference]: Finished difference Result 62450 states and 108528 transitions. [2025-03-08 05:31:27,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:31:27,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 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 124 [2025-03-08 05:31:27,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:27,414 INFO L225 Difference]: With dead ends: 62450 [2025-03-08 05:31:27,414 INFO L226 Difference]: Without dead ends: 33085 [2025-03-08 05:31:27,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03-08 05:31:27,475 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 131 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 2728 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:27,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 2728 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:27,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33085 states. [2025-03-08 05:31:28,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33085 to 33077. [2025-03-08 05:31:28,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33077 states, 27328 states have (on average 1.6495169789227166) internal successors, (45078), 27336 states have internal predecessors, (45078), 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-03-08 05:31:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33077 states to 33077 states and 57137 transitions. [2025-03-08 05:31:28,760 INFO L78 Accepts]: Start accepts. Automaton has 33077 states and 57137 transitions. Word has length 124 [2025-03-08 05:31:28,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:28,761 INFO L471 AbstractCegarLoop]: Abstraction has 33077 states and 57137 transitions. [2025-03-08 05:31:28,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 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-03-08 05:31:28,761 INFO L276 IsEmpty]: Start isEmpty. Operand 33077 states and 57137 transitions. [2025-03-08 05:31:28,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 05:31:28,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:28,785 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-03-08 05:31:28,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:31:28,786 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:28,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:28,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1764260982, now seen corresponding path program 1 times [2025-03-08 05:31:28,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:28,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987972916] [2025-03-08 05:31:28,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:28,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:28,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 05:31:28,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:31:28,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:28,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:28,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:28,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987972916] [2025-03-08 05:31:28,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987972916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:28,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:28,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:28,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481811442] [2025-03-08 05:31:28,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:28,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:28,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:28,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:28,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:28,846 INFO L87 Difference]: Start difference. First operand 33077 states and 57137 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-03-08 05:31:29,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:29,978 INFO L93 Difference]: Finished difference Result 90242 states and 156312 transitions. [2025-03-08 05:31:29,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:29,978 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-03-08 05:31:29,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:30,226 INFO L225 Difference]: With dead ends: 90242 [2025-03-08 05:31:30,227 INFO L226 Difference]: Without dead ends: 60660 [2025-03-08 05:31:30,311 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-03-08 05:31:30,312 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 116 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1130 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-03-08 05:31:30,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:30,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60660 states. [2025-03-08 05:31:32,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60660 to 60652. [2025-03-08 05:31:32,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60652 states, 50390 states have (on average 1.644770787854733) internal successors, (82880), 50398 states have internal predecessors, (82880), 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-03-08 05:31:32,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60652 states to 60652 states and 104497 transitions. [2025-03-08 05:31:32,813 INFO L78 Accepts]: Start accepts. Automaton has 60652 states and 104497 transitions. Word has length 124 [2025-03-08 05:31:32,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:32,814 INFO L471 AbstractCegarLoop]: Abstraction has 60652 states and 104497 transitions. [2025-03-08 05:31:32,814 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-03-08 05:31:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 60652 states and 104497 transitions. [2025-03-08 05:31:32,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 05:31:32,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:32,845 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-03-08 05:31:32,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:31:32,845 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:32,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:32,846 INFO L85 PathProgramCache]: Analyzing trace with hash 678999925, now seen corresponding path program 1 times [2025-03-08 05:31:32,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:32,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995253129] [2025-03-08 05:31:32,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:32,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:32,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 05:31:32,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 05:31:32,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:32,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:32,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:32,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995253129] [2025-03-08 05:31:32,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995253129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:32,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:32,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:32,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274955387] [2025-03-08 05:31:32,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:32,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:32,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:32,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:32,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:32,908 INFO L87 Difference]: Start difference. First operand 60652 states and 104497 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-03-08 05:31:34,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:34,941 INFO L93 Difference]: Finished difference Result 113589 states and 196092 transitions. [2025-03-08 05:31:34,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:34,942 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-03-08 05:31:34,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:35,494 INFO L225 Difference]: With dead ends: 113589 [2025-03-08 05:31:35,494 INFO L226 Difference]: Without dead ends: 113412 [2025-03-08 05:31:35,572 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-03-08 05:31:35,574 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 111 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1128 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-03-08 05:31:35,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1128 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:35,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113412 states. [2025-03-08 05:31:39,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113412 to 113404. [2025-03-08 05:31:39,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113404 states, 94774 states have (on average 1.6390254711207715) internal successors, (155337), 94782 states have internal predecessors, (155337), 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-03-08 05:31:39,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113404 states to 113404 states and 194736 transitions. [2025-03-08 05:31:39,617 INFO L78 Accepts]: Start accepts. Automaton has 113404 states and 194736 transitions. Word has length 125 [2025-03-08 05:31:39,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:39,618 INFO L471 AbstractCegarLoop]: Abstraction has 113404 states and 194736 transitions. [2025-03-08 05:31:39,618 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-03-08 05:31:39,618 INFO L276 IsEmpty]: Start isEmpty. Operand 113404 states and 194736 transitions. [2025-03-08 05:31:39,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 05:31:39,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:39,650 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-03-08 05:31:39,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:31:39,651 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:39,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:39,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1447979447, now seen corresponding path program 1 times [2025-03-08 05:31:39,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:39,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879874996] [2025-03-08 05:31:39,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:39,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:39,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 05:31:39,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 05:31:39,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:39,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:39,876 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:39,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:39,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879874996] [2025-03-08 05:31:39,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879874996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:39,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:39,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 05:31:39,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277810124] [2025-03-08 05:31:39,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:39,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:31:39,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:39,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:31:39,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:31:39,878 INFO L87 Difference]: Start difference. First operand 113404 states and 194736 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 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-03-08 05:31:45,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:45,266 INFO L93 Difference]: Finished difference Result 225970 states and 393496 transitions. [2025-03-08 05:31:45,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 05:31:45,267 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 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 126 [2025-03-08 05:31:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:46,217 INFO L225 Difference]: With dead ends: 225970 [2025-03-08 05:31:46,217 INFO L226 Difference]: Without dead ends: 225799 [2025-03-08 05:31:46,320 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-03-08 05:31:46,321 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 1409 mSDsluCounter, 5815 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 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, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:46,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 6504 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 05:31:46,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225799 states.