./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product29.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_spec8_product29.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 9244be1607acf28cf3da39a66e263e3f7b227fe42ed993f89a6311649f8ded26 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:36:48,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:36:48,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:36:48,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:36:48,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:36:48,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:36:48,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:36:48,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:36:48,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:36:48,295 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:36:48,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:36:48,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:36:48,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:36:48,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:36:48,296 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:36:48,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:36:48,296 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:36:48,296 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:36:48,296 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:36:48,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:36:48,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:36:48,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:36:48,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:36:48,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:36:48,296 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:36:48,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:36:48,297 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:36:48,297 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:36:48,297 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:36:48,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:36:48,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:36:48,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:36:48,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:36:48,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:36:48,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:36:48,297 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:36:48,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:36:48,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:36:48,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:36:48,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:36:48,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:36:48,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:36:48,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:36:48,297 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 -> 9244be1607acf28cf3da39a66e263e3f7b227fe42ed993f89a6311649f8ded26 [2025-03-08 05:36:48,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:36:48,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:36:48,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:36:48,509 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:36:48,509 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:36:48,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product29.cil.c [2025-03-08 05:36:49,616 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfdaf2189/b2a950f1a8f641daac9ecef2b9db73c0/FLAGe21606802 [2025-03-08 05:36:49,882 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:36:49,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product29.cil.c [2025-03-08 05:36:49,896 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfdaf2189/b2a950f1a8f641daac9ecef2b9db73c0/FLAGe21606802 [2025-03-08 05:36:50,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfdaf2189/b2a950f1a8f641daac9ecef2b9db73c0 [2025-03-08 05:36:50,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:36:50,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:36:50,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:36:50,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:36:50,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:36:50,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:36:50" (1/1) ... [2025-03-08 05:36:50,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63171e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:50, skipping insertion in model container [2025-03-08 05:36:50,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:36:50" (1/1) ... [2025-03-08 05:36:50,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:36:50,528 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_spec8_product29.cil.c[29472,29485] [2025-03-08 05:36:50,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:36:50,645 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:36:50,651 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-03-08 05:36:50,652 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [460] [2025-03-08 05:36:50,652 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [509] [2025-03-08 05:36:50,652 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [648] [2025-03-08 05:36:50,652 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [692] [2025-03-08 05:36:50,652 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1058] [2025-03-08 05:36:50,652 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1075] [2025-03-08 05:36:50,653 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1300] [2025-03-08 05:36:50,653 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1309] [2025-03-08 05:36:50,653 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1688] [2025-03-08 05:36:50,653 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1975] [2025-03-08 05:36:50,698 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_spec8_product29.cil.c[29472,29485] [2025-03-08 05:36:50,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:36:50,760 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:36:50,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:50 WrapperNode [2025-03-08 05:36:50,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:36:50,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:36:50,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:36:50,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:36:50,766 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:36:50" (1/1) ... [2025-03-08 05:36:50,781 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:36:50" (1/1) ... [2025-03-08 05:36:50,823 INFO L138 Inliner]: procedures = 132, calls = 214, calls flagged for inlining = 56, calls inlined = 48, statements flattened = 937 [2025-03-08 05:36:50,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:36:50,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:36:50,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:36:50,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:36:50,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:50" (1/1) ... [2025-03-08 05:36:50,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:50" (1/1) ... [2025-03-08 05:36:50,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:50" (1/1) ... [2025-03-08 05:36:50,856 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:36:50,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:50" (1/1) ... [2025-03-08 05:36:50,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:50" (1/1) ... [2025-03-08 05:36:50,866 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:50" (1/1) ... [2025-03-08 05:36:50,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:50" (1/1) ... [2025-03-08 05:36:50,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:50" (1/1) ... [2025-03-08 05:36:50,874 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:50" (1/1) ... [2025-03-08 05:36:50,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:36:50,883 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:36:50,883 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:36:50,883 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:36:50,884 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:50" (1/1) ... [2025-03-08 05:36:50,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:36:50,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:50,918 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:36:50,924 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:36:50,940 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-08 05:36:50,940 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-08 05:36:50,940 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-08 05:36:50,940 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-08 05:36:50,940 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:36:50,940 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:36:50,940 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-08 05:36:50,941 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-08 05:36:50,941 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:36:50,941 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:36:50,941 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:36:50,941 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:36:50,942 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:36:50,942 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:36:50,942 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:36:50,942 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:36:50,942 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:36:50,942 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:36:50,942 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:36:50,943 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:36:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:36:50,943 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:36:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:36:50,943 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:36:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:36:50,943 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:36:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:36:50,943 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:36:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:36:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:36:50,943 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:36:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-08 05:36:50,943 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-08 05:36:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-08 05:36:50,943 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-08 05:36:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:36:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:36:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:36:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:36:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:36:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:36:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-08 05:36:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-08 05:36:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2025-03-08 05:36:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2025-03-08 05:36:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:36:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:36:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:36:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:36:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:36:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:36:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:36:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:36:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:36:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:36:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:36:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:36:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:36:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:36:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-08 05:36:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-08 05:36:50,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:36:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:36:51,116 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:36:51,117 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:36:51,204 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L367: #res := ~retValue_acc~8; [2025-03-08 05:36:51,217 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1599: #res := ~retValue_acc~25; [2025-03-08 05:36:51,253 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2673: #res#1 := ~retValue_acc~38#1; [2025-03-08 05:36:51,253 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2628-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~37#1; [2025-03-08 05:36:51,280 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2897: #res := ~retValue_acc~41; [2025-03-08 05:36:51,391 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3016-1: getClientId_#res#1 := getClientId_~retValue_acc~43#1; [2025-03-08 05:36:51,403 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2581: #res := ~retValue_acc~36; [2025-03-08 05:36:51,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L645-1: createEmail_#res#1 := createEmail_~retValue_acc~16#1; [2025-03-08 05:36:51,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2125: #res := ~retValue_acc~30; [2025-03-08 05:36:51,431 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L293: #res := ~retValue_acc~6; [2025-03-08 05:36:51,465 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: #res := ~retValue_acc~7; [2025-03-08 05:36:51,471 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L404: #res := ~retValue_acc~9; [2025-03-08 05:36:51,491 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: #res := ~retValue_acc~3; [2025-03-08 05:36:51,539 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2451: #res := ~retValue_acc~34; [2025-03-08 05:36:51,770 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2843-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~40#1; [2025-03-08 05:36:51,771 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L506-1: valid_product_#res#1 := valid_product_~retValue_acc~12#1; [2025-03-08 05:36:51,771 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~39#1; [2025-03-08 05:36:51,771 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1556-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~22#1; [2025-03-08 05:36:51,771 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1565-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~23#1; [2025-03-08 05:36:51,771 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1574-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~24#1; [2025-03-08 05:36:51,776 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: #res := ~retValue_acc~2; [2025-03-08 05:36:51,784 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L621: #res#1 := ~retValue_acc~14#1; [2025-03-08 05:36:51,784 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L601-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~13#1; [2025-03-08 05:36:51,906 INFO L? ?]: Removed 505 outVars from TransFormulas that were not future-live. [2025-03-08 05:36:51,907 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:36:51,919 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:36:51,920 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:36:51,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:36:51 BoogieIcfgContainer [2025-03-08 05:36:51,920 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:36:51,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:36:51,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:36:51,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:36:51,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:36:50" (1/3) ... [2025-03-08 05:36:51,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d50eb43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:36:51, skipping insertion in model container [2025-03-08 05:36:51,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:50" (2/3) ... [2025-03-08 05:36:51,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d50eb43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:36:51, skipping insertion in model container [2025-03-08 05:36:51,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:36:51" (3/3) ... [2025-03-08 05:36:51,926 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec8_product29.cil.c [2025-03-08 05:36:51,936 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:36:51,938 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec8_product29.cil.c that has 29 procedures, 407 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:36:51,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:36:51,990 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;@38d0684, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:36:51,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:36:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 407 states, 314 states have (on average 1.5541401273885351) internal successors, (488), 319 states have internal predecessors, (488), 63 states have call successors, (63), 28 states have call predecessors, (63), 28 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-08 05:36:52,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:36:52,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:52,008 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:52,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:52,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:52,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1658423740, now seen corresponding path program 1 times [2025-03-08 05:36:52,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:52,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133679628] [2025-03-08 05:36:52,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:52,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:52,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:36:52,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:36:52,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:52,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:52,583 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:36:52,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:52,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133679628] [2025-03-08 05:36:52,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133679628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:52,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874987011] [2025-03-08 05:36:52,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:52,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:52,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:52,588 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:36:52,590 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:36:52,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:36:52,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:36:52,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:52,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:52,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:36:52,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:52,919 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:36:52,919 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:36:52,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874987011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:52,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:36:52,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:36:52,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138174356] [2025-03-08 05:36:52,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:52,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:52,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:52,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:52,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:36:52,943 INFO L87 Difference]: Start difference. First operand has 407 states, 314 states have (on average 1.5541401273885351) internal successors, (488), 319 states have internal predecessors, (488), 63 states have call successors, (63), 28 states have call predecessors, (63), 28 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:36:53,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:53,004 INFO L93 Difference]: Finished difference Result 629 states and 932 transitions. [2025-03-08 05:36:53,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:53,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2025-03-08 05:36:53,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:53,015 INFO L225 Difference]: With dead ends: 629 [2025-03-08 05:36:53,015 INFO L226 Difference]: Without dead ends: 401 [2025-03-08 05:36:53,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 110 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:36:53,026 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 0 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1217 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:36:53,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1217 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:53,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-08 05:36:53,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2025-03-08 05:36:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 309 states have (on average 1.5501618122977345) internal successors, (479), 313 states have internal predecessors, (479), 63 states have call successors, (63), 28 states have call predecessors, (63), 28 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 05:36:53,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 604 transitions. [2025-03-08 05:36:53,080 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 604 transitions. Word has length 110 [2025-03-08 05:36:53,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:53,081 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 604 transitions. [2025-03-08 05:36:53,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:36:53,081 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 604 transitions. [2025-03-08 05:36:53,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:36:53,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:53,085 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:53,096 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:36:53,288 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:36:53,288 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:53,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:53,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1687091908, now seen corresponding path program 1 times [2025-03-08 05:36:53,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:53,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599971392] [2025-03-08 05:36:53,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:53,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:53,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:36:53,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:36:53,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:53,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:53,535 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:36:53,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:53,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599971392] [2025-03-08 05:36:53,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599971392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:53,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021857128] [2025-03-08 05:36:53,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:53,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:53,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:53,539 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:36:53,540 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:36:53,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:36:53,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:36:53,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:53,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:53,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:36:53,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:53,802 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:36:53,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:36:53,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021857128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:53,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:36:53,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:36:53,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413757326] [2025-03-08 05:36:53,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:53,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:53,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:53,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:53,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:36:53,808 INFO L87 Difference]: Start difference. First operand 401 states and 604 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:36:53,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:53,845 INFO L93 Difference]: Finished difference Result 844 states and 1291 transitions. [2025-03-08 05:36:53,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:53,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-03-08 05:36:53,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:53,851 INFO L225 Difference]: With dead ends: 844 [2025-03-08 05:36:53,851 INFO L226 Difference]: Without dead ends: 469 [2025-03-08 05:36:53,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 114 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:36:53,853 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 126 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1176 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:36:53,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1176 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:53,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-08 05:36:53,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 461. [2025-03-08 05:36:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 355 states have (on average 1.5718309859154929) internal successors, (558), 359 states have internal predecessors, (558), 77 states have call successors, (77), 28 states have call predecessors, (77), 28 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 05:36:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 711 transitions. [2025-03-08 05:36:53,875 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 711 transitions. Word has length 114 [2025-03-08 05:36:53,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:53,875 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 711 transitions. [2025-03-08 05:36:53,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:36:53,876 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 711 transitions. [2025-03-08 05:36:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 05:36:53,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:53,882 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:53,891 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:36:54,082 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:36:54,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:54,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:54,084 INFO L85 PathProgramCache]: Analyzing trace with hash 449238990, now seen corresponding path program 1 times [2025-03-08 05:36:54,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:54,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151036410] [2025-03-08 05:36:54,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:54,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:54,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:36:54,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:36:54,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:54,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:54,248 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:36:54,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:54,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151036410] [2025-03-08 05:36:54,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151036410] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:54,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821949882] [2025-03-08 05:36:54,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:54,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:54,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:54,254 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:36:54,255 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:36:54,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:36:54,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:36:54,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:54,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:54,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:36:54,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:54,524 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:36:54,524 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:36:54,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821949882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:54,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:36:54,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:36:54,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92946589] [2025-03-08 05:36:54,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:54,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:54,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:54,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:54,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:36:54,526 INFO L87 Difference]: Start difference. First operand 461 states and 711 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:36:54,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:54,587 INFO L93 Difference]: Finished difference Result 913 states and 1412 transitions. [2025-03-08 05:36:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:54,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2025-03-08 05:36:54,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:54,592 INFO L225 Difference]: With dead ends: 913 [2025-03-08 05:36:54,592 INFO L226 Difference]: Without dead ends: 463 [2025-03-08 05:36:54,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 113 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:36:54,595 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 2 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2369 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:36:54,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2369 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:54,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-03-08 05:36:54,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2025-03-08 05:36:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 356 states have (on average 1.5702247191011236) internal successors, (559), 361 states have internal predecessors, (559), 77 states have call successors, (77), 28 states have call predecessors, (77), 29 states have return successors, (78), 75 states have call predecessors, (78), 76 states have call successors, (78) [2025-03-08 05:36:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 714 transitions. [2025-03-08 05:36:54,622 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 714 transitions. Word has length 115 [2025-03-08 05:36:54,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:54,623 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 714 transitions. [2025-03-08 05:36:54,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:36:54,623 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 714 transitions. [2025-03-08 05:36:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:36:54,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:54,627 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:54,636 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:36:54,827 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:36:54,827 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:54,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:54,828 INFO L85 PathProgramCache]: Analyzing trace with hash -217051405, now seen corresponding path program 1 times [2025-03-08 05:36:54,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:54,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151762696] [2025-03-08 05:36:54,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:54,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:54,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:36:54,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:36:54,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:54,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:55,001 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:36:55,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:55,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151762696] [2025-03-08 05:36:55,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151762696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:55,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784464208] [2025-03-08 05:36:55,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:55,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:55,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:55,004 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:36:55,006 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:36:55,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:36:55,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:36:55,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:55,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:55,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:36:55,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:55,263 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:36:55,263 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:36:55,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784464208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:55,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:36:55,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:36:55,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855683735] [2025-03-08 05:36:55,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:55,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:55,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:55,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:55,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:36:55,264 INFO L87 Difference]: Start difference. First operand 463 states and 714 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:36:55,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:55,318 INFO L93 Difference]: Finished difference Result 915 states and 1417 transitions. [2025-03-08 05:36:55,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:55,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2025-03-08 05:36:55,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:55,322 INFO L225 Difference]: With dead ends: 915 [2025-03-08 05:36:55,322 INFO L226 Difference]: Without dead ends: 465 [2025-03-08 05:36:55,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 114 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:36:55,325 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 2 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2355 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:36:55,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2355 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:55,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-08 05:36:55,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2025-03-08 05:36:55,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 357 states have (on average 1.5686274509803921) internal successors, (560), 363 states have internal predecessors, (560), 77 states have call successors, (77), 28 states have call predecessors, (77), 30 states have return successors, (83), 75 states have call predecessors, (83), 76 states have call successors, (83) [2025-03-08 05:36:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 720 transitions. [2025-03-08 05:36:55,349 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 720 transitions. Word has length 116 [2025-03-08 05:36:55,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:55,350 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 720 transitions. [2025-03-08 05:36:55,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:36:55,350 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 720 transitions. [2025-03-08 05:36:55,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 05:36:55,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:55,354 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:36:55,362 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:36:55,558 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:36:55,558 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:55,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:55,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1945822684, now seen corresponding path program 1 times [2025-03-08 05:36:55,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:55,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744946640] [2025-03-08 05:36:55,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:55,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:55,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:36:55,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:36:55,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:55,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:55,678 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:36:55,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:55,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744946640] [2025-03-08 05:36:55,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744946640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:55,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:55,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:36:55,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274562734] [2025-03-08 05:36:55,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:55,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:55,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:55,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:55,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:55,679 INFO L87 Difference]: Start difference. First operand 465 states and 720 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:36:55,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:55,715 INFO L93 Difference]: Finished difference Result 907 states and 1408 transitions. [2025-03-08 05:36:55,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:55,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2025-03-08 05:36:55,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:55,718 INFO L225 Difference]: With dead ends: 907 [2025-03-08 05:36:55,718 INFO L226 Difference]: Without dead ends: 465 [2025-03-08 05:36:55,719 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:36:55,720 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 2 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2373 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:36:55,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2373 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:55,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-08 05:36:55,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2025-03-08 05:36:55,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 357 states have (on average 1.5686274509803921) internal successors, (560), 363 states have internal predecessors, (560), 77 states have call successors, (77), 28 states have call predecessors, (77), 30 states have return successors, (82), 75 states have call predecessors, (82), 76 states have call successors, (82) [2025-03-08 05:36:55,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 719 transitions. [2025-03-08 05:36:55,737 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 719 transitions. Word has length 117 [2025-03-08 05:36:55,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:55,737 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 719 transitions. [2025-03-08 05:36:55,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:36:55,737 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 719 transitions. [2025-03-08 05:36:55,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:36:55,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:55,741 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:55,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:36:55,741 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:55,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:55,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1511057877, now seen corresponding path program 2 times [2025-03-08 05:36:55,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:55,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080870517] [2025-03-08 05:36:55,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:36:55,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:55,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-03-08 05:36:55,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:36:55,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:36:55,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:55,875 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:36:55,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:55,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080870517] [2025-03-08 05:36:55,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080870517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:55,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:55,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:36:55,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432552838] [2025-03-08 05:36:55,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:55,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:55,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:55,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:55,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:55,877 INFO L87 Difference]: Start difference. First operand 465 states and 719 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:36:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:55,923 INFO L93 Difference]: Finished difference Result 905 states and 1403 transitions. [2025-03-08 05:36:55,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:55,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2025-03-08 05:36:55,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:55,927 INFO L225 Difference]: With dead ends: 905 [2025-03-08 05:36:55,928 INFO L226 Difference]: Without dead ends: 465 [2025-03-08 05:36:55,929 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:36:55,930 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 2 mSDsluCounter, 1765 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2359 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:36:55,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2359 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:55,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-08 05:36:55,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2025-03-08 05:36:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 357 states have (on average 1.5686274509803921) internal successors, (560), 363 states have internal predecessors, (560), 77 states have call successors, (77), 28 states have call predecessors, (77), 30 states have return successors, (81), 75 states have call predecessors, (81), 76 states have call successors, (81) [2025-03-08 05:36:55,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 718 transitions. [2025-03-08 05:36:55,950 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 718 transitions. Word has length 118 [2025-03-08 05:36:55,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:55,951 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 718 transitions. [2025-03-08 05:36:55,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:36:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 718 transitions. [2025-03-08 05:36:55,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 05:36:55,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:55,952 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:55,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:36:55,953 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:55,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:55,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1102338558, now seen corresponding path program 3 times [2025-03-08 05:36:55,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:55,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766618373] [2025-03-08 05:36:55,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:36:55,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:55,972 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 119 statements into 3 equivalence classes. [2025-03-08 05:36:55,984 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 107 of 119 statements. [2025-03-08 05:36:55,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 05:36:55,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:56,063 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:36:56,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:56,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766618373] [2025-03-08 05:36:56,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766618373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:56,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:56,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:36:56,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229964618] [2025-03-08 05:36:56,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:56,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:56,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:56,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:56,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:56,065 INFO L87 Difference]: Start difference. First operand 465 states and 718 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:36:56,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:56,113 INFO L93 Difference]: Finished difference Result 907 states and 1409 transitions. [2025-03-08 05:36:56,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:56,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2025-03-08 05:36:56,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:56,116 INFO L225 Difference]: With dead ends: 907 [2025-03-08 05:36:56,116 INFO L226 Difference]: Without dead ends: 467 [2025-03-08 05:36:56,118 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:36:56,119 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 1 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2370 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:36:56,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2370 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:56,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-08 05:36:56,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2025-03-08 05:36:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 358 states have (on average 1.5670391061452513) internal successors, (561), 365 states have internal predecessors, (561), 77 states have call successors, (77), 28 states have call predecessors, (77), 31 states have return successors, (86), 75 states have call predecessors, (86), 76 states have call successors, (86) [2025-03-08 05:36:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 724 transitions. [2025-03-08 05:36:56,137 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 724 transitions. Word has length 119 [2025-03-08 05:36:56,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:56,138 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 724 transitions. [2025-03-08 05:36:56,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:36:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 724 transitions. [2025-03-08 05:36:56,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 05:36:56,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:56,140 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:56,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:36:56,140 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:56,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:56,141 INFO L85 PathProgramCache]: Analyzing trace with hash -312251442, now seen corresponding path program 1 times [2025-03-08 05:36:56,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:56,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455131921] [2025-03-08 05:36:56,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:56,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:56,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 05:36:56,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 05:36:56,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:56,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:56,253 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:36:56,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:56,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455131921] [2025-03-08 05:36:56,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455131921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:56,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:56,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:36:56,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753386908] [2025-03-08 05:36:56,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:56,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:56,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:56,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:56,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:56,254 INFO L87 Difference]: Start difference. First operand 467 states and 724 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:36:56,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:56,291 INFO L93 Difference]: Finished difference Result 913 states and 1419 transitions. [2025-03-08 05:36:56,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:56,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2025-03-08 05:36:56,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:56,294 INFO L225 Difference]: With dead ends: 913 [2025-03-08 05:36:56,294 INFO L226 Difference]: Without dead ends: 469 [2025-03-08 05:36:56,296 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:36:56,296 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 1 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2376 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:36:56,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2376 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:56,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-08 05:36:56,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2025-03-08 05:36:56,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 359 states have (on average 1.565459610027855) internal successors, (562), 367 states have internal predecessors, (562), 77 states have call successors, (77), 28 states have call predecessors, (77), 32 states have return successors, (88), 75 states have call predecessors, (88), 76 states have call successors, (88) [2025-03-08 05:36:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 727 transitions. [2025-03-08 05:36:56,310 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 727 transitions. Word has length 120 [2025-03-08 05:36:56,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:56,310 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 727 transitions. [2025-03-08 05:36:56,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:36:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 727 transitions. [2025-03-08 05:36:56,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 05:36:56,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:56,312 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:36:56,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:36:56,312 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:56,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:56,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1979806763, now seen corresponding path program 1 times [2025-03-08 05:36:56,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:56,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635085235] [2025-03-08 05:36:56,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:56,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:56,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:36:56,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:36:56,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:56,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:56,421 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:36:56,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:56,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635085235] [2025-03-08 05:36:56,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635085235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:56,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:56,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:36:56,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494699603] [2025-03-08 05:36:56,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:56,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:56,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:56,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:56,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:56,423 INFO L87 Difference]: Start difference. First operand 469 states and 727 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:36:56,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:56,472 INFO L93 Difference]: Finished difference Result 915 states and 1422 transitions. [2025-03-08 05:36:56,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:56,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2025-03-08 05:36:56,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:56,476 INFO L225 Difference]: With dead ends: 915 [2025-03-08 05:36:56,476 INFO L226 Difference]: Without dead ends: 471 [2025-03-08 05:36:56,478 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:36:56,478 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 0 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:56,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2369 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:56,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-08 05:36:56,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 469. [2025-03-08 05:36:56,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 359 states have (on average 1.565459610027855) internal successors, (562), 367 states have internal predecessors, (562), 77 states have call successors, (77), 28 states have call predecessors, (77), 32 states have return successors, (88), 75 states have call predecessors, (88), 76 states have call successors, (88) [2025-03-08 05:36:56,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 727 transitions. [2025-03-08 05:36:56,500 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 727 transitions. Word has length 121 [2025-03-08 05:36:56,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:56,500 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 727 transitions. [2025-03-08 05:36:56,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:36:56,500 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 727 transitions. [2025-03-08 05:36:56,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 05:36:56,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:56,502 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:36:56,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:36:56,503 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:56,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:56,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1105918294, now seen corresponding path program 1 times [2025-03-08 05:36:56,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:56,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700397744] [2025-03-08 05:36:56,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:56,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:56,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:36:56,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:36:56,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:56,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:56,638 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:36:56,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:56,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700397744] [2025-03-08 05:36:56,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700397744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:56,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254427078] [2025-03-08 05:36:56,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:56,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:56,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:56,642 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:36:56,644 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:36:56,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:36:56,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:36:56,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:56,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:56,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:36:56,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:56,884 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:36:56,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:36:56,960 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:36:56,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254427078] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:36:56,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:36:56,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 05:36:56,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573918107] [2025-03-08 05:36:56,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:36:56,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:36:56,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:56,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:36:56,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:36:56,962 INFO L87 Difference]: Start difference. First operand 469 states and 727 transitions. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:36:57,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:57,087 INFO L93 Difference]: Finished difference Result 1090 states and 1751 transitions. [2025-03-08 05:36:57,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:36:57,089 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 121 [2025-03-08 05:36:57,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:57,094 INFO L225 Difference]: With dead ends: 1090 [2025-03-08 05:36:57,094 INFO L226 Difference]: Without dead ends: 875 [2025-03-08 05:36:57,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 239 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:36:57,096 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 372 mSDsluCounter, 2133 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 2767 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:57,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 2767 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:36:57,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-03-08 05:36:57,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 851. [2025-03-08 05:36:57,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 662 states have (on average 1.6374622356495467) internal successors, (1084), 670 states have internal predecessors, (1084), 156 states have call successors, (156), 28 states have call predecessors, (156), 32 states have return successors, (177), 154 states have call predecessors, (177), 155 states have call successors, (177) [2025-03-08 05:36:57,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1417 transitions. [2025-03-08 05:36:57,138 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1417 transitions. Word has length 121 [2025-03-08 05:36:57,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:57,139 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1417 transitions. [2025-03-08 05:36:57,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:36:57,139 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1417 transitions. [2025-03-08 05:36:57,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 05:36:57,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:57,143 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:57,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:36:57,344 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:36:57,344 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:57,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:57,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1049337435, now seen corresponding path program 1 times [2025-03-08 05:36:57,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:57,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606581691] [2025-03-08 05:36:57,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:57,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:57,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 05:36:57,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 05:36:57,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:57,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:57,395 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:36:57,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:57,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606581691] [2025-03-08 05:36:57,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606581691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:57,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:57,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:57,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771405383] [2025-03-08 05:36:57,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:57,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:57,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:57,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:57,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:57,397 INFO L87 Difference]: Start difference. First operand 851 states and 1417 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:36:57,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:57,432 INFO L93 Difference]: Finished difference Result 2024 states and 3423 transitions. [2025-03-08 05:36:57,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:57,432 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2025-03-08 05:36:57,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:57,438 INFO L225 Difference]: With dead ends: 2024 [2025-03-08 05:36:57,439 INFO L226 Difference]: Without dead ends: 1237 [2025-03-08 05:36:57,441 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:36:57,442 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 124 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1208 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:36:57,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1208 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:57,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2025-03-08 05:36:57,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1229. [2025-03-08 05:36:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 961 states have (on average 1.6566077003121749) internal successors, (1592), 969 states have internal predecessors, (1592), 235 states have call successors, (235), 28 states have call predecessors, (235), 32 states have return successors, (266), 233 states have call predecessors, (266), 234 states have call successors, (266) [2025-03-08 05:36:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 2093 transitions. [2025-03-08 05:36:57,486 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 2093 transitions. Word has length 128 [2025-03-08 05:36:57,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:57,486 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 2093 transitions. [2025-03-08 05:36:57,486 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:36:57,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 2093 transitions. [2025-03-08 05:36:57,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 05:36:57,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:57,492 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:57,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:36:57,493 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:57,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:57,493 INFO L85 PathProgramCache]: Analyzing trace with hash 31743966, now seen corresponding path program 1 times [2025-03-08 05:36:57,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:57,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049628404] [2025-03-08 05:36:57,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:57,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:57,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 05:36:57,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 05:36:57,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:57,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:57,549 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:36:57,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:57,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049628404] [2025-03-08 05:36:57,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049628404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:57,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:57,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:57,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109044182] [2025-03-08 05:36:57,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:57,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:57,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:57,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:57,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:57,550 INFO L87 Difference]: Start difference. First operand 1229 states and 2093 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:36:57,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:57,630 INFO L93 Difference]: Finished difference Result 2945 states and 5053 transitions. [2025-03-08 05:36:57,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:57,631 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2025-03-08 05:36:57,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:57,640 INFO L225 Difference]: With dead ends: 2945 [2025-03-08 05:36:57,640 INFO L226 Difference]: Without dead ends: 1829 [2025-03-08 05:36:57,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:57,644 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 122 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1198 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:36:57,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1198 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:57,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2025-03-08 05:36:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1821. [2025-03-08 05:36:57,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1434 states have (on average 1.6701534170153418) internal successors, (2395), 1442 states have internal predecessors, (2395), 354 states have call successors, (354), 28 states have call predecessors, (354), 32 states have return successors, (385), 352 states have call predecessors, (385), 353 states have call successors, (385) [2025-03-08 05:36:57,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 3134 transitions. [2025-03-08 05:36:57,720 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 3134 transitions. Word has length 129 [2025-03-08 05:36:57,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:57,720 INFO L471 AbstractCegarLoop]: Abstraction has 1821 states and 3134 transitions. [2025-03-08 05:36:57,720 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:36:57,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 3134 transitions. [2025-03-08 05:36:57,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 05:36:57,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:57,730 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:57,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:36:57,730 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:57,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:57,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2034395898, now seen corresponding path program 1 times [2025-03-08 05:36:57,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:57,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733346819] [2025-03-08 05:36:57,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:57,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:57,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 05:36:57,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 05:36:57,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:57,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:57,790 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:36:57,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:57,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733346819] [2025-03-08 05:36:57,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733346819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:57,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:57,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:57,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326984979] [2025-03-08 05:36:57,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:57,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:57,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:57,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:57,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:57,792 INFO L87 Difference]: Start difference. First operand 1821 states and 3134 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:36:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:57,860 INFO L93 Difference]: Finished difference Result 4324 states and 7507 transitions. [2025-03-08 05:36:57,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:57,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-03-08 05:36:57,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:57,876 INFO L225 Difference]: With dead ends: 4324 [2025-03-08 05:36:57,876 INFO L226 Difference]: Without dead ends: 2734 [2025-03-08 05:36:57,882 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:36:57,883 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 120 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1195 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:36:57,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1195 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2734 states. [2025-03-08 05:36:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2734 to 2726. [2025-03-08 05:36:58,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2726 states, 2177 states have (on average 1.6812126779972438) internal successors, (3660), 2185 states have internal predecessors, (3660), 516 states have call successors, (516), 28 states have call predecessors, (516), 32 states have return successors, (563), 514 states have call predecessors, (563), 515 states have call successors, (563) [2025-03-08 05:36:58,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 4739 transitions. [2025-03-08 05:36:58,035 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 4739 transitions. Word has length 130 [2025-03-08 05:36:58,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:58,036 INFO L471 AbstractCegarLoop]: Abstraction has 2726 states and 4739 transitions. [2025-03-08 05:36:58,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:36:58,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 4739 transitions. [2025-03-08 05:36:58,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 05:36:58,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:58,049 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:58,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:36:58,049 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:58,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:58,050 INFO L85 PathProgramCache]: Analyzing trace with hash 215936223, now seen corresponding path program 1 times [2025-03-08 05:36:58,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:58,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703679047] [2025-03-08 05:36:58,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:58,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:58,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 05:36:58,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:36:58,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:58,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:58,104 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:36:58,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:58,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703679047] [2025-03-08 05:36:58,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703679047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:58,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:58,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:58,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704375975] [2025-03-08 05:36:58,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:58,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:58,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:58,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:58,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:58,105 INFO L87 Difference]: Start difference. First operand 2726 states and 4739 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:36:58,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:58,240 INFO L93 Difference]: Finished difference Result 6496 states and 11382 transitions. [2025-03-08 05:36:58,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:58,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 131 [2025-03-08 05:36:58,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:58,263 INFO L225 Difference]: With dead ends: 6496 [2025-03-08 05:36:58,263 INFO L226 Difference]: Without dead ends: 4194 [2025-03-08 05:36:58,271 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:36:58,272 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 118 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1195 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:36:58,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1195 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:58,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4194 states. [2025-03-08 05:36:58,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4194 to 4186. [2025-03-08 05:36:58,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4186 states, 3392 states have (on average 1.6892688679245282) internal successors, (5730), 3400 states have internal predecessors, (5730), 761 states have call successors, (761), 28 states have call predecessors, (761), 32 states have return successors, (834), 759 states have call predecessors, (834), 760 states have call successors, (834) [2025-03-08 05:36:58,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 7325 transitions. [2025-03-08 05:36:58,497 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 7325 transitions. Word has length 131 [2025-03-08 05:36:58,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:58,497 INFO L471 AbstractCegarLoop]: Abstraction has 4186 states and 7325 transitions. [2025-03-08 05:36:58,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:36:58,497 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 7325 transitions. [2025-03-08 05:36:58,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 05:36:58,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:58,514 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:58,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:36:58,515 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:58,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:58,515 INFO L85 PathProgramCache]: Analyzing trace with hash -402333511, now seen corresponding path program 1 times [2025-03-08 05:36:58,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:58,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821907105] [2025-03-08 05:36:58,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:58,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:58,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:36:58,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:36:58,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:58,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:58,559 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:36:58,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:58,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821907105] [2025-03-08 05:36:58,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821907105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:58,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:58,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:58,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409313743] [2025-03-08 05:36:58,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:58,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:58,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:58,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:58,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:58,561 INFO L87 Difference]: Start difference. First operand 4186 states and 7325 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:36:58,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:58,730 INFO L93 Difference]: Finished difference Result 10379 states and 18261 transitions. [2025-03-08 05:36:58,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:58,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-03-08 05:36:58,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:58,763 INFO L225 Difference]: With dead ends: 10379 [2025-03-08 05:36:58,763 INFO L226 Difference]: Without dead ends: 6833 [2025-03-08 05:36:58,776 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:36:58,776 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 116 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1223 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:36:58,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1223 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:58,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6833 states. [2025-03-08 05:36:59,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6833 to 6825. [2025-03-08 05:36:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6825 states, 5538 states have (on average 1.686710003611412) internal successors, (9341), 5546 states have internal predecessors, (9341), 1254 states have call successors, (1254), 28 states have call predecessors, (1254), 32 states have return successors, (1371), 1252 states have call predecessors, (1371), 1253 states have call successors, (1371) [2025-03-08 05:36:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6825 states to 6825 states and 11966 transitions. [2025-03-08 05:36:59,064 INFO L78 Accepts]: Start accepts. Automaton has 6825 states and 11966 transitions. Word has length 132 [2025-03-08 05:36:59,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:59,065 INFO L471 AbstractCegarLoop]: Abstraction has 6825 states and 11966 transitions. [2025-03-08 05:36:59,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:36:59,065 INFO L276 IsEmpty]: Start isEmpty. Operand 6825 states and 11966 transitions. [2025-03-08 05:36:59,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 05:36:59,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:59,090 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:59,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:36:59,090 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:59,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:59,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1494448416, now seen corresponding path program 1 times [2025-03-08 05:36:59,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:59,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697492204] [2025-03-08 05:36:59,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:59,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:59,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 05:36:59,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 05:36:59,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:59,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:59,139 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:36:59,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:59,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697492204] [2025-03-08 05:36:59,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697492204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:59,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:59,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:59,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972879492] [2025-03-08 05:36:59,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:59,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:59,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:59,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:59,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:59,141 INFO L87 Difference]: Start difference. First operand 6825 states and 11966 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:36:59,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:59,410 INFO L93 Difference]: Finished difference Result 17281 states and 30484 transitions. [2025-03-08 05:36:59,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:59,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2025-03-08 05:36:59,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:59,458 INFO L225 Difference]: With dead ends: 17281 [2025-03-08 05:36:59,459 INFO L226 Difference]: Without dead ends: 11451 [2025-03-08 05:36:59,481 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:36:59,481 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 114 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1208 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:36:59,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1208 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:59,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11451 states. [2025-03-08 05:36:59,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11451 to 11443. [2025-03-08 05:36:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11443 states, 9334 states have (on average 1.687700878508678) internal successors, (15753), 9342 states have internal predecessors, (15753), 2076 states have call successors, (2076), 28 states have call predecessors, (2076), 32 states have return successors, (2271), 2074 states have call predecessors, (2271), 2075 states have call successors, (2271) [2025-03-08 05:37:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11443 states to 11443 states and 20100 transitions. [2025-03-08 05:37:00,010 INFO L78 Accepts]: Start accepts. Automaton has 11443 states and 20100 transitions. Word has length 133 [2025-03-08 05:37:00,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:00,010 INFO L471 AbstractCegarLoop]: Abstraction has 11443 states and 20100 transitions. [2025-03-08 05:37:00,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:37:00,011 INFO L276 IsEmpty]: Start isEmpty. Operand 11443 states and 20100 transitions. [2025-03-08 05:37:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 05:37:00,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:00,052 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:00,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:37:00,053 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:00,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:00,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1110610408, now seen corresponding path program 1 times [2025-03-08 05:37:00,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:00,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163299343] [2025-03-08 05:37:00,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:00,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:00,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 05:37:00,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 05:37:00,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:00,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:00,123 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:37:00,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:00,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163299343] [2025-03-08 05:37:00,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163299343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:00,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:00,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:00,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230336096] [2025-03-08 05:37:00,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:00,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:00,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:00,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:00,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:00,125 INFO L87 Difference]: Start difference. First operand 11443 states and 20100 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:37:00,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:00,578 INFO L93 Difference]: Finished difference Result 27274 states and 47888 transitions. [2025-03-08 05:37:00,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:00,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 134 [2025-03-08 05:37:00,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:00,653 INFO L225 Difference]: With dead ends: 27274 [2025-03-08 05:37:00,654 INFO L226 Difference]: Without dead ends: 17741 [2025-03-08 05:37:00,687 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:37:00,687 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 112 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1178 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:37:00,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1178 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:00,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17741 states. [2025-03-08 05:37:01,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17741 to 17733. [2025-03-08 05:37:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17733 states, 14421 states have (on average 1.6653491436100132) internal successors, (24016), 14429 states have internal predecessors, (24016), 3279 states have call successors, (3279), 28 states have call predecessors, (3279), 32 states have return successors, (3618), 3277 states have call predecessors, (3618), 3278 states have call successors, (3618) [2025-03-08 05:37:01,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17733 states to 17733 states and 30913 transitions. [2025-03-08 05:37:01,367 INFO L78 Accepts]: Start accepts. Automaton has 17733 states and 30913 transitions. Word has length 134 [2025-03-08 05:37:01,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:01,367 INFO L471 AbstractCegarLoop]: Abstraction has 17733 states and 30913 transitions. [2025-03-08 05:37:01,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:37:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 17733 states and 30913 transitions. [2025-03-08 05:37:01,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 05:37:01,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:01,405 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:01,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:37:01,406 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:01,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:01,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1132898849, now seen corresponding path program 1 times [2025-03-08 05:37:01,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:01,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481658539] [2025-03-08 05:37:01,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:01,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:01,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 05:37:01,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 05:37:01,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:01,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:01,460 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:37:01,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:01,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481658539] [2025-03-08 05:37:01,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481658539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:01,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:01,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:01,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746797966] [2025-03-08 05:37:01,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:01,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:01,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:01,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:01,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:01,462 INFO L87 Difference]: Start difference. First operand 17733 states and 30913 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:37:02,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:02,223 INFO L93 Difference]: Finished difference Result 46861 states and 82017 transitions. [2025-03-08 05:37:02,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:02,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 135 [2025-03-08 05:37:02,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:02,382 INFO L225 Difference]: With dead ends: 46861 [2025-03-08 05:37:02,382 INFO L226 Difference]: Without dead ends: 31608 [2025-03-08 05:37:02,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:02,440 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 110 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1198 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:37:02,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1198 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:02,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31608 states. [2025-03-08 05:37:03,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31608 to 31600. [2025-03-08 05:37:03,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31600 states, 25838 states have (on average 1.6624351730010063) internal successors, (42954), 25846 states have internal predecessors, (42954), 5729 states have call successors, (5729), 28 states have call predecessors, (5729), 32 states have return successors, (6342), 5727 states have call predecessors, (6342), 5728 states have call successors, (6342) [2025-03-08 05:37:03,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31600 states to 31600 states and 55025 transitions. [2025-03-08 05:37:03,785 INFO L78 Accepts]: Start accepts. Automaton has 31600 states and 55025 transitions. Word has length 135 [2025-03-08 05:37:03,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:03,785 INFO L471 AbstractCegarLoop]: Abstraction has 31600 states and 55025 transitions. [2025-03-08 05:37:03,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:37:03,786 INFO L276 IsEmpty]: Start isEmpty. Operand 31600 states and 55025 transitions. [2025-03-08 05:37:03,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 05:37:03,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:03,832 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:03,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:37:03,832 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:03,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:03,833 INFO L85 PathProgramCache]: Analyzing trace with hash -429707808, now seen corresponding path program 2 times [2025-03-08 05:37:03,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:03,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005384492] [2025-03-08 05:37:03,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:37:03,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:03,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 136 statements into 2 equivalence classes. [2025-03-08 05:37:03,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 05:37:03,859 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:37:03,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:03,903 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:37:03,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:03,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005384492] [2025-03-08 05:37:03,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005384492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:03,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:03,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:03,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079027801] [2025-03-08 05:37:03,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:03,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:03,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:03,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:03,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:03,906 INFO L87 Difference]: Start difference. First operand 31600 states and 55025 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:37:04,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:04,607 INFO L93 Difference]: Finished difference Result 59681 states and 104068 transitions. [2025-03-08 05:37:04,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:04,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 136 [2025-03-08 05:37:04,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:04,741 INFO L225 Difference]: With dead ends: 59681 [2025-03-08 05:37:04,741 INFO L226 Difference]: Without dead ends: 31608 [2025-03-08 05:37:04,810 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:37:04,810 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 123 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:37:04,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1363 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:04,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31608 states. [2025-03-08 05:37:05,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31608 to 31600. [2025-03-08 05:37:05,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31600 states, 25838 states have (on average 1.6521402585339422) internal successors, (42688), 25846 states have internal predecessors, (42688), 5729 states have call successors, (5729), 28 states have call predecessors, (5729), 32 states have return successors, (6342), 5727 states have call predecessors, (6342), 5728 states have call successors, (6342) [2025-03-08 05:37:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31600 states to 31600 states and 54759 transitions. [2025-03-08 05:37:05,970 INFO L78 Accepts]: Start accepts. Automaton has 31600 states and 54759 transitions. Word has length 136 [2025-03-08 05:37:05,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:05,971 INFO L471 AbstractCegarLoop]: Abstraction has 31600 states and 54759 transitions. [2025-03-08 05:37:05,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:37:05,971 INFO L276 IsEmpty]: Start isEmpty. Operand 31600 states and 54759 transitions. [2025-03-08 05:37:06,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 05:37:06,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:06,009 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:06,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:37:06,010 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:06,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:06,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1467239063, now seen corresponding path program 1 times [2025-03-08 05:37:06,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:06,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989626350] [2025-03-08 05:37:06,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:06,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:06,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 05:37:06,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 05:37:06,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:06,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:06,062 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:37:06,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:06,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989626350] [2025-03-08 05:37:06,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989626350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:06,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:06,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:06,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482653227] [2025-03-08 05:37:06,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:06,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:06,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:06,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:06,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:06,063 INFO L87 Difference]: Start difference. First operand 31600 states and 54759 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:37:07,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:07,672 INFO L93 Difference]: Finished difference Result 86143 states and 149724 transitions. [2025-03-08 05:37:07,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:07,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 136 [2025-03-08 05:37:07,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:07,989 INFO L225 Difference]: With dead ends: 86143 [2025-03-08 05:37:07,989 INFO L226 Difference]: Without dead ends: 57853 [2025-03-08 05:37:08,102 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:37:08,105 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 108 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1201 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:37:08,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1201 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:08,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57853 states. [2025-03-08 05:37:10,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57853 to 57845. [2025-03-08 05:37:10,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57845 states, 47570 states have (on average 1.6472987176792095) internal successors, (78362), 47578 states have internal predecessors, (78362), 10242 states have call successors, (10242), 28 states have call predecessors, (10242), 32 states have return successors, (11387), 10240 states have call predecessors, (11387), 10241 states have call successors, (11387) [2025-03-08 05:37:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57845 states to 57845 states and 99991 transitions. [2025-03-08 05:37:10,510 INFO L78 Accepts]: Start accepts. Automaton has 57845 states and 99991 transitions. Word has length 136 [2025-03-08 05:37:10,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:10,510 INFO L471 AbstractCegarLoop]: Abstraction has 57845 states and 99991 transitions. [2025-03-08 05:37:10,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:37:10,511 INFO L276 IsEmpty]: Start isEmpty. Operand 57845 states and 99991 transitions. [2025-03-08 05:37:10,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 05:37:10,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:10,560 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:10,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:37:10,561 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:10,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:10,564 INFO L85 PathProgramCache]: Analyzing trace with hash -161365054, now seen corresponding path program 1 times [2025-03-08 05:37:10,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:10,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447307164] [2025-03-08 05:37:10,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:10,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:10,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 05:37:10,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 05:37:10,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:10,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:10,620 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:37:10,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:10,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447307164] [2025-03-08 05:37:10,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447307164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:10,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:10,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:10,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066087108] [2025-03-08 05:37:10,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:10,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:10,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:10,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:10,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:10,621 INFO L87 Difference]: Start difference. First operand 57845 states and 99991 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:37:12,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:12,645 INFO L93 Difference]: Finished difference Result 108205 states and 187448 transitions. [2025-03-08 05:37:12,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:12,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2025-03-08 05:37:12,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:13,145 INFO L225 Difference]: With dead ends: 108205 [2025-03-08 05:37:13,145 INFO L226 Difference]: Without dead ends: 107990 [2025-03-08 05:37:13,209 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:37:13,211 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 103 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:37:13,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1204 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:13,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107990 states. [2025-03-08 05:37:16,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107990 to 107982. [2025-03-08 05:37:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107982 states, 89339 states have (on average 1.6413324527921735) internal successors, (146635), 89347 states have internal predecessors, (146635), 18610 states have call successors, (18610), 28 states have call predecessors, (18610), 32 states have return successors, (20801), 18608 states have call predecessors, (20801), 18609 states have call successors, (20801) [2025-03-08 05:37:17,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107982 states to 107982 states and 186046 transitions. [2025-03-08 05:37:17,129 INFO L78 Accepts]: Start accepts. Automaton has 107982 states and 186046 transitions. Word has length 137 [2025-03-08 05:37:17,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:17,130 INFO L471 AbstractCegarLoop]: Abstraction has 107982 states and 186046 transitions. [2025-03-08 05:37:17,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:37:17,130 INFO L276 IsEmpty]: Start isEmpty. Operand 107982 states and 186046 transitions. [2025-03-08 05:37:17,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 05:37:17,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:17,203 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:17,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:37:17,204 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:17,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:17,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1690234582, now seen corresponding path program 1 times [2025-03-08 05:37:17,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:17,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419693236] [2025-03-08 05:37:17,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:17,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:17,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 05:37:17,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 05:37:17,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:17,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:17,524 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:37:17,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:17,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419693236] [2025-03-08 05:37:17,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419693236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:17,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:17,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 05:37:17,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868858990] [2025-03-08 05:37:17,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:17,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 05:37:17,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:17,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 05:37:17,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:37:17,526 INFO L87 Difference]: Start difference. First operand 107982 states and 186046 transitions. Second operand has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 6 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-08 05:37:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:23,059 INFO L93 Difference]: Finished difference Result 215351 states and 376431 transitions. [2025-03-08 05:37:23,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 05:37:23,059 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 6 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 138 [2025-03-08 05:37:23,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:24,370 INFO L225 Difference]: With dead ends: 215351 [2025-03-08 05:37:24,370 INFO L226 Difference]: Without dead ends: 215142 [2025-03-08 05:37:24,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2025-03-08 05:37:24,469 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 1739 mSDsluCounter, 7190 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1739 SdHoareTripleChecker+Valid, 7869 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:37:24,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1739 Valid, 7869 Invalid, 2003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 05:37:24,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215142 states.