./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_product29.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec27_product29.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f1b2e6fc3090957bb44fbf381fe29c5adbd1106bdb77e2b6b77c5e6e962ffc5b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:52:11,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:52:11,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:52:11,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:52:11,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:52:11,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:52:11,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:52:11,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:52:11,662 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:52:11,662 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:52:11,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:52:11,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:52:11,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:52:11,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:52:11,662 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:52:11,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:52:11,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:52:11,663 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:52:11,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:52:11,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:52:11,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:52:11,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:52:11,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:52:11,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:52:11,663 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:52:11,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:52:11,663 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:52:11,663 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:52:11,663 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:52:11,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:52:11,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:52:11,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:52:11,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:11,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:52:11,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:52:11,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:52:11,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:52:11,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:11,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:52:11,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:52:11,664 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:52:11,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:52:11,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:52:11,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:52:11,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:52:11,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:52:11,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:52:11,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:52:11,664 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f1b2e6fc3090957bb44fbf381fe29c5adbd1106bdb77e2b6b77c5e6e962ffc5b [2025-01-09 03:52:11,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:52:11,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:52:11,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:52:11,910 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:52:11,910 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:52:11,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product29.cil.c [2025-01-09 03:52:13,110 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f10f2b19/f38862fd90974e9c84617bb08716c7f1/FLAG2663fbbb0 [2025-01-09 03:52:13,445 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:52:13,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product29.cil.c [2025-01-09 03:52:13,464 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f10f2b19/f38862fd90974e9c84617bb08716c7f1/FLAG2663fbbb0 [2025-01-09 03:52:13,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f10f2b19/f38862fd90974e9c84617bb08716c7f1 [2025-01-09 03:52:13,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:52:13,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:52:13,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:52:13,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:52:13,483 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:52:13,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:52:13" (1/1) ... [2025-01-09 03:52:13,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47b75864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:13, skipping insertion in model container [2025-01-09 03:52:13,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:52:13" (1/1) ... [2025-01-09 03:52:13,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:52:13,835 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product29.cil.c[37973,37986] [2025-01-09 03:52:13,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:52:13,984 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:52:13,990 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-01-09 03:52:13,991 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [414] [2025-01-09 03:52:13,991 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1494] [2025-01-09 03:52:13,991 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1543] [2025-01-09 03:52:13,991 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1561] [2025-01-09 03:52:13,991 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1570] [2025-01-09 03:52:13,991 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1718] [2025-01-09 03:52:13,991 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1943] [2025-01-09 03:52:13,991 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2320] [2025-01-09 03:52:13,992 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2717] [2025-01-09 03:52:13,992 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [2995] [2025-01-09 03:52:14,029 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product29.cil.c[37973,37986] [2025-01-09 03:52:14,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:52:14,088 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:52:14,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:14 WrapperNode [2025-01-09 03:52:14,090 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:52:14,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:52:14,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:52:14,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:52:14,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:14" (1/1) ... [2025-01-09 03:52:14,114 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:14" (1/1) ... [2025-01-09 03:52:14,153 INFO L138 Inliner]: procedures = 131, calls = 212, calls flagged for inlining = 54, calls inlined = 47, statements flattened = 927 [2025-01-09 03:52:14,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:52:14,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:52:14,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:52:14,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:52:14,167 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:14" (1/1) ... [2025-01-09 03:52:14,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:14" (1/1) ... [2025-01-09 03:52:14,172 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:14" (1/1) ... [2025-01-09 03:52:14,199 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-01-09 03:52:14,200 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:14" (1/1) ... [2025-01-09 03:52:14,200 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:14" (1/1) ... [2025-01-09 03:52:14,212 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:14" (1/1) ... [2025-01-09 03:52:14,213 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:14" (1/1) ... [2025-01-09 03:52:14,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:14" (1/1) ... [2025-01-09 03:52:14,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:14" (1/1) ... [2025-01-09 03:52:14,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:14" (1/1) ... [2025-01-09 03:52:14,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:52:14,235 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:52:14,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:52:14,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:52:14,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:14" (1/1) ... [2025-01-09 03:52:14,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:14,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:14,281 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:52:14,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:52:14,304 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:52:14,304 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:52:14,304 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-01-09 03:52:14,304 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-01-09 03:52:14,304 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:52:14,304 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:52:14,304 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-01-09 03:52:14,304 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-01-09 03:52:14,304 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:52:14,304 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:52:14,305 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:52:14,305 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:52:14,305 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:52:14,305 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:52:14,305 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:52:14,305 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:52:14,305 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:52:14,305 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:52:14,305 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:52:14,305 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:52:14,305 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:52:14,305 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:52:14,305 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:52:14,306 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:52:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:52:14,306 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:52:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:52:14,306 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:52:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:52:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:52:14,306 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:52:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:52:14,306 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:52:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-01-09 03:52:14,306 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-01-09 03:52:14,306 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:52:14,306 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:52:14,307 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:52:14,307 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:52:14,307 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:52:14,307 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:52:14,307 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-01-09 03:52:14,307 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-01-09 03:52:14,307 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2025-01-09 03:52:14,307 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2025-01-09 03:52:14,307 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:52:14,307 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:52:14,307 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:52:14,307 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:52:14,307 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:52:14,307 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:52:14,307 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:52:14,307 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:52:14,307 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:52:14,307 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:52:14,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:52:14,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:52:14,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:52:14,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:52:14,307 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:52:14,307 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:52:14,307 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-01-09 03:52:14,307 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-01-09 03:52:14,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:52:14,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:52:14,464 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:52:14,467 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:52:15,196 INFO L? ?]: Removed 510 outVars from TransFormulas that were not future-live. [2025-01-09 03:52:15,196 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:52:15,216 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:52:15,216 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:52:15,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:52:15 BoogieIcfgContainer [2025-01-09 03:52:15,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:52:15,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:52:15,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:52:15,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:52:15,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:52:13" (1/3) ... [2025-01-09 03:52:15,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4a7002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:52:15, skipping insertion in model container [2025-01-09 03:52:15,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:14" (2/3) ... [2025-01-09 03:52:15,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4a7002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:52:15, skipping insertion in model container [2025-01-09 03:52:15,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:52:15" (3/3) ... [2025-01-09 03:52:15,225 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product29.cil.c [2025-01-09 03:52:15,238 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:52:15,241 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product29.cil.c that has 30 procedures, 414 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:52:15,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:52:15,293 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;@84b1a11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:52:15,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:52:15,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 414 states, 319 states have (on average 1.5517241379310345) internal successors, (495), 324 states have internal predecessors, (495), 64 states have call successors, (64), 29 states have call predecessors, (64), 29 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 03:52:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 03:52:15,309 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:15,310 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:15,311 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:15,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:15,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1433995388, now seen corresponding path program 1 times [2025-01-09 03:52:15,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:15,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873291809] [2025-01-09 03:52:15,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:15,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:15,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 03:52:15,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 03:52:15,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:15,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 03:52:16,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:16,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873291809] [2025-01-09 03:52:16,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873291809] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:16,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908963059] [2025-01-09 03:52:16,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:16,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:16,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:16,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:16,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:52:16,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 03:52:16,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 03:52:16,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:16,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:16,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 03:52:16,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:52:16,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:16,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908963059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:16,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:16,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-01-09 03:52:16,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97885617] [2025-01-09 03:52:16,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:16,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:52:16,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:16,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:52:16,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:16,492 INFO L87 Difference]: Start difference. First operand has 414 states, 319 states have (on average 1.5517241379310345) internal successors, (495), 324 states have internal predecessors, (495), 64 states have call successors, (64), 29 states have call predecessors, (64), 29 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) Second operand has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:16,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:16,543 INFO L93 Difference]: Finished difference Result 641 states and 946 transitions. [2025-01-09 03:52:16,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:52:16,544 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 151 [2025-01-09 03:52:16,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:16,558 INFO L225 Difference]: With dead ends: 641 [2025-01-09 03:52:16,558 INFO L226 Difference]: Without dead ends: 407 [2025-01-09 03:52:16,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:16,565 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:16,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:16,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-01-09 03:52:16,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2025-01-09 03:52:16,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 313 states have (on average 1.549520766773163) internal successors, (485), 317 states have internal predecessors, (485), 64 states have call successors, (64), 29 states have call predecessors, (64), 29 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2025-01-09 03:52:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 612 transitions. [2025-01-09 03:52:16,623 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 612 transitions. Word has length 151 [2025-01-09 03:52:16,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:16,626 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 612 transitions. [2025-01-09 03:52:16,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 612 transitions. [2025-01-09 03:52:16,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 03:52:16,634 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:16,634 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:16,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 03:52:16,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 03:52:16,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:16,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:16,840 INFO L85 PathProgramCache]: Analyzing trace with hash 240131722, now seen corresponding path program 1 times [2025-01-09 03:52:16,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:16,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86927783] [2025-01-09 03:52:16,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:16,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:16,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 03:52:16,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 03:52:16,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:16,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 03:52:17,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:17,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86927783] [2025-01-09 03:52:17,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86927783] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:17,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409716216] [2025-01-09 03:52:17,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:17,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:17,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:17,155 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:17,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:52:17,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 03:52:17,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 03:52:17,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:17,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:17,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:52:17,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:17,478 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:52:17,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:17,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409716216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:17,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:17,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:52:17,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397486029] [2025-01-09 03:52:17,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:17,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:17,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:17,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:17,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:52:17,484 INFO L87 Difference]: Start difference. First operand 407 states and 612 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:17,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:17,529 INFO L93 Difference]: Finished difference Result 630 states and 924 transitions. [2025-01-09 03:52:17,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:17,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 151 [2025-01-09 03:52:17,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:17,536 INFO L225 Difference]: With dead ends: 630 [2025-01-09 03:52:17,536 INFO L226 Difference]: Without dead ends: 409 [2025-01-09 03:52:17,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:52:17,540 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 1 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:17,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1218 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:17,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-01-09 03:52:17,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 408. [2025-01-09 03:52:17,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 314 states have (on average 1.5477707006369428) internal successors, (486), 318 states have internal predecessors, (486), 64 states have call successors, (64), 29 states have call predecessors, (64), 29 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2025-01-09 03:52:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 613 transitions. [2025-01-09 03:52:17,569 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 613 transitions. Word has length 151 [2025-01-09 03:52:17,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:17,569 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 613 transitions. [2025-01-09 03:52:17,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:17,569 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 613 transitions. [2025-01-09 03:52:17,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 03:52:17,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:17,572 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:17,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:52:17,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:17,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:17,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:17,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1514289887, now seen corresponding path program 1 times [2025-01-09 03:52:17,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:17,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761236125] [2025-01-09 03:52:17,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:17,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:17,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 03:52:17,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 03:52:17,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:17,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:52:17,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761236125] [2025-01-09 03:52:17,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761236125] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843196399] [2025-01-09 03:52:17,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:17,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:17,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:17,984 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:17,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:52:18,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 03:52:18,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 03:52:18,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:18,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:18,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:52:18,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:18,287 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-09 03:52:18,287 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:18,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843196399] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:18,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:18,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:52:18,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473154865] [2025-01-09 03:52:18,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:18,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:18,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:18,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:18,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:52:18,288 INFO L87 Difference]: Start difference. First operand 408 states and 613 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:18,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:18,339 INFO L93 Difference]: Finished difference Result 859 states and 1310 transitions. [2025-01-09 03:52:18,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:18,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2025-01-09 03:52:18,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:18,342 INFO L225 Difference]: With dead ends: 859 [2025-01-09 03:52:18,342 INFO L226 Difference]: Without dead ends: 477 [2025-01-09 03:52:18,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:52:18,344 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 126 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:18,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1196 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:18,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-01-09 03:52:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 469. [2025-01-09 03:52:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 361 states have (on average 1.5678670360110802) internal successors, (566), 365 states have internal predecessors, (566), 78 states have call successors, (78), 29 states have call predecessors, (78), 29 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2025-01-09 03:52:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 721 transitions. [2025-01-09 03:52:18,371 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 721 transitions. Word has length 175 [2025-01-09 03:52:18,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:18,371 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 721 transitions. [2025-01-09 03:52:18,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:18,372 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 721 transitions. [2025-01-09 03:52:18,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 03:52:18,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:18,379 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:18,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:52:18,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:18,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:18,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:18,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1245559941, now seen corresponding path program 1 times [2025-01-09 03:52:18,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:18,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836994564] [2025-01-09 03:52:18,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:18,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:18,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 03:52:18,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 03:52:18,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:18,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:18,743 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:52:18,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:18,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836994564] [2025-01-09 03:52:18,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836994564] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:18,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485082485] [2025-01-09 03:52:18,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:18,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:18,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:18,746 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:18,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:52:18,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 03:52:19,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 03:52:19,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:19,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:19,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 1229 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:52:19,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:19,070 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:52:19,071 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:19,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485082485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:19,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:19,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:52:19,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969943021] [2025-01-09 03:52:19,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:19,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:19,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:19,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:19,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:52:19,075 INFO L87 Difference]: Start difference. First operand 469 states and 721 transitions. Second operand has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 03:52:19,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:19,147 INFO L93 Difference]: Finished difference Result 929 states and 1432 transitions. [2025-01-09 03:52:19,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:19,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2025-01-09 03:52:19,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:19,153 INFO L225 Difference]: With dead ends: 929 [2025-01-09 03:52:19,153 INFO L226 Difference]: Without dead ends: 471 [2025-01-09 03:52:19,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:52:19,158 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 2 mSDsluCounter, 1801 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2405 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:19,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2405 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:19,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-01-09 03:52:19,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2025-01-09 03:52:19,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 362 states have (on average 1.5662983425414365) internal successors, (567), 367 states have internal predecessors, (567), 78 states have call successors, (78), 29 states have call predecessors, (78), 30 states have return successors, (79), 76 states have call predecessors, (79), 77 states have call successors, (79) [2025-01-09 03:52:19,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 724 transitions. [2025-01-09 03:52:19,184 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 724 transitions. Word has length 157 [2025-01-09 03:52:19,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:19,184 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 724 transitions. [2025-01-09 03:52:19,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 03:52:19,185 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 724 transitions. [2025-01-09 03:52:19,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 03:52:19,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:19,189 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:19,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:52:19,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:19,390 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:19,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:19,391 INFO L85 PathProgramCache]: Analyzing trace with hash -509406836, now seen corresponding path program 1 times [2025-01-09 03:52:19,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:19,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890928545] [2025-01-09 03:52:19,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:19,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:19,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 03:52:19,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 03:52:19,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:19,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:19,559 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:19,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:19,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890928545] [2025-01-09 03:52:19,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890928545] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:19,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167760823] [2025-01-09 03:52:19,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:19,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:19,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:19,563 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:19,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:52:19,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 03:52:19,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 03:52:19,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:19,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:19,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 1230 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:52:19,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:19,876 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:52:19,877 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:19,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167760823] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:19,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:19,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:52:19,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860470787] [2025-01-09 03:52:19,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:19,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:19,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:19,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:19,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:52:19,879 INFO L87 Difference]: Start difference. First operand 471 states and 724 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 03:52:19,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:19,954 INFO L93 Difference]: Finished difference Result 931 states and 1437 transitions. [2025-01-09 03:52:19,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:19,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 158 [2025-01-09 03:52:19,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:19,957 INFO L225 Difference]: With dead ends: 931 [2025-01-09 03:52:19,957 INFO L226 Difference]: Without dead ends: 473 [2025-01-09 03:52:19,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:52:19,959 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 2 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:19,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2391 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:19,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-01-09 03:52:19,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2025-01-09 03:52:19,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 363 states have (on average 1.5647382920110193) internal successors, (568), 369 states have internal predecessors, (568), 78 states have call successors, (78), 29 states have call predecessors, (78), 31 states have return successors, (84), 76 states have call predecessors, (84), 77 states have call successors, (84) [2025-01-09 03:52:19,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 730 transitions. [2025-01-09 03:52:19,989 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 730 transitions. Word has length 158 [2025-01-09 03:52:19,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:19,989 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 730 transitions. [2025-01-09 03:52:19,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 03:52:19,989 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 730 transitions. [2025-01-09 03:52:19,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 03:52:19,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:19,993 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:20,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 03:52:20,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:20,197 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:20,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:20,198 INFO L85 PathProgramCache]: Analyzing trace with hash -935917138, now seen corresponding path program 1 times [2025-01-09 03:52:20,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:20,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804049791] [2025-01-09 03:52:20,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:20,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:20,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 03:52:20,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 03:52:20,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:20,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:20,347 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:52:20,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:20,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804049791] [2025-01-09 03:52:20,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804049791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:20,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:20,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:52:20,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202583714] [2025-01-09 03:52:20,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:20,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:20,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:20,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:20,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:20,349 INFO L87 Difference]: Start difference. First operand 473 states and 730 transitions. Second operand has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 03:52:20,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:20,388 INFO L93 Difference]: Finished difference Result 923 states and 1428 transitions. [2025-01-09 03:52:20,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:20,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 159 [2025-01-09 03:52:20,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:20,391 INFO L225 Difference]: With dead ends: 923 [2025-01-09 03:52:20,391 INFO L226 Difference]: Without dead ends: 473 [2025-01-09 03:52:20,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:20,393 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 2 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2409 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:20,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2409 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:20,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-01-09 03:52:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2025-01-09 03:52:20,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 363 states have (on average 1.5647382920110193) internal successors, (568), 369 states have internal predecessors, (568), 78 states have call successors, (78), 29 states have call predecessors, (78), 31 states have return successors, (83), 76 states have call predecessors, (83), 77 states have call successors, (83) [2025-01-09 03:52:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 729 transitions. [2025-01-09 03:52:20,409 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 729 transitions. Word has length 159 [2025-01-09 03:52:20,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:20,409 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 729 transitions. [2025-01-09 03:52:20,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 03:52:20,410 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 729 transitions. [2025-01-09 03:52:20,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 03:52:20,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:20,412 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:20,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:52:20,412 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:20,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:20,413 INFO L85 PathProgramCache]: Analyzing trace with hash -322004579, now seen corresponding path program 2 times [2025-01-09 03:52:20,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:20,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491201994] [2025-01-09 03:52:20,413 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:52:20,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:20,432 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 160 statements into 2 equivalence classes. [2025-01-09 03:52:20,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 80 of 160 statements. [2025-01-09 03:52:20,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:52:20,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:20,568 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 03:52:20,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:20,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491201994] [2025-01-09 03:52:20,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491201994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:20,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:20,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:52:20,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5835259] [2025-01-09 03:52:20,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:20,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:52:20,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:20,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:52:20,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:52:20,571 INFO L87 Difference]: Start difference. First operand 473 states and 729 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 03:52:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:20,996 INFO L93 Difference]: Finished difference Result 1222 states and 1861 transitions. [2025-01-09 03:52:20,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 03:52:20,996 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-01-09 03:52:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:21,001 INFO L225 Difference]: With dead ends: 1222 [2025-01-09 03:52:21,002 INFO L226 Difference]: Without dead ends: 1009 [2025-01-09 03:52:21,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:52:21,003 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 669 mSDsluCounter, 3434 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 4044 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:21,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 4044 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:52:21,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-01-09 03:52:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 927. [2025-01-09 03:52:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 715 states have (on average 1.5734265734265733) internal successors, (1125), 724 states have internal predecessors, (1125), 150 states have call successors, (150), 58 states have call predecessors, (150), 61 states have return successors, (163), 148 states have call predecessors, (163), 148 states have call successors, (163) [2025-01-09 03:52:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1438 transitions. [2025-01-09 03:52:21,047 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1438 transitions. Word has length 160 [2025-01-09 03:52:21,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:21,047 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1438 transitions. [2025-01-09 03:52:21,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 03:52:21,048 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1438 transitions. [2025-01-09 03:52:21,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 03:52:21,052 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:21,052 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:21,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:52:21,052 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:21,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:21,052 INFO L85 PathProgramCache]: Analyzing trace with hash -706262330, now seen corresponding path program 1 times [2025-01-09 03:52:21,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:21,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330973518] [2025-01-09 03:52:21,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:21,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:21,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 03:52:21,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 03:52:21,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:21,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:21,243 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:52:21,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:21,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330973518] [2025-01-09 03:52:21,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330973518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:21,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:21,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:52:21,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866458232] [2025-01-09 03:52:21,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:21,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:21,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:21,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:21,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:21,246 INFO L87 Difference]: Start difference. First operand 927 states and 1438 transitions. Second operand has 5 states, 4 states have (on average 26.5) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:52:21,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:21,301 INFO L93 Difference]: Finished difference Result 1833 states and 2849 transitions. [2025-01-09 03:52:21,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:21,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.5) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 180 [2025-01-09 03:52:21,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:21,308 INFO L225 Difference]: With dead ends: 1833 [2025-01-09 03:52:21,308 INFO L226 Difference]: Without dead ends: 929 [2025-01-09 03:52:21,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:21,312 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 1 mSDsluCounter, 1806 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2412 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:21,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2412 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:21,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-01-09 03:52:21,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 929. [2025-01-09 03:52:21,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 716 states have (on average 1.5726256983240223) internal successors, (1126), 726 states have internal predecessors, (1126), 150 states have call successors, (150), 58 states have call predecessors, (150), 62 states have return successors, (165), 148 states have call predecessors, (165), 148 states have call successors, (165) [2025-01-09 03:52:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1441 transitions. [2025-01-09 03:52:21,346 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1441 transitions. Word has length 180 [2025-01-09 03:52:21,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:21,346 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1441 transitions. [2025-01-09 03:52:21,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.5) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:52:21,346 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1441 transitions. [2025-01-09 03:52:21,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 03:52:21,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:21,349 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:21,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:52:21,350 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:21,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:21,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1435214788, now seen corresponding path program 1 times [2025-01-09 03:52:21,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:21,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732921305] [2025-01-09 03:52:21,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:21,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:21,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 03:52:21,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 03:52:21,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:21,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 03:52:21,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:21,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732921305] [2025-01-09 03:52:21,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732921305] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:21,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:21,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:52:21,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721578438] [2025-01-09 03:52:21,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:21,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:52:21,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:21,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:52:21,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:52:21,486 INFO L87 Difference]: Start difference. First operand 929 states and 1441 transitions. Second operand has 8 states, 7 states have (on average 15.714285714285714) internal successors, (110), 8 states have internal predecessors, (110), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 03:52:21,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:21,594 INFO L93 Difference]: Finished difference Result 1378 states and 2136 transitions. [2025-01-09 03:52:21,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:52:21,594 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 15.714285714285714) internal successors, (110), 8 states have internal predecessors, (110), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 181 [2025-01-09 03:52:21,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:21,598 INFO L225 Difference]: With dead ends: 1378 [2025-01-09 03:52:21,598 INFO L226 Difference]: Without dead ends: 477 [2025-01-09 03:52:21,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:52:21,601 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 7 mSDsluCounter, 3547 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4143 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:21,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4143 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:52:21,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-01-09 03:52:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2025-01-09 03:52:21,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 366 states have (on average 1.5601092896174864) internal successors, (571), 372 states have internal predecessors, (571), 78 states have call successors, (78), 30 states have call predecessors, (78), 32 states have return successors, (84), 76 states have call predecessors, (84), 77 states have call successors, (84) [2025-01-09 03:52:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 733 transitions. [2025-01-09 03:52:21,616 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 733 transitions. Word has length 181 [2025-01-09 03:52:21,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:21,616 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 733 transitions. [2025-01-09 03:52:21,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 15.714285714285714) internal successors, (110), 8 states have internal predecessors, (110), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 03:52:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 733 transitions. [2025-01-09 03:52:21,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 03:52:21,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:21,618 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:21,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:52:21,618 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:21,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:21,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1458169022, now seen corresponding path program 1 times [2025-01-09 03:52:21,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:21,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359282352] [2025-01-09 03:52:21,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:21,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:21,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 03:52:21,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 03:52:21,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:21,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 03:52:21,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:21,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359282352] [2025-01-09 03:52:21,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359282352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:21,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:21,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:52:21,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613915854] [2025-01-09 03:52:21,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:21,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:52:21,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:21,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:52:21,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:52:21,786 INFO L87 Difference]: Start difference. First operand 477 states and 733 transitions. Second operand has 8 states, 7 states have (on average 15.571428571428571) internal successors, (109), 8 states have internal predecessors, (109), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 03:52:21,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:21,899 INFO L93 Difference]: Finished difference Result 930 states and 1437 transitions. [2025-01-09 03:52:21,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:52:21,900 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 15.571428571428571) internal successors, (109), 8 states have internal predecessors, (109), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 181 [2025-01-09 03:52:21,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:21,903 INFO L225 Difference]: With dead ends: 930 [2025-01-09 03:52:21,903 INFO L226 Difference]: Without dead ends: 480 [2025-01-09 03:52:21,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:52:21,904 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 5 mSDsluCounter, 3559 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4157 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:21,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4157 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:52:21,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-01-09 03:52:21,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-01-09 03:52:21,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 368 states have (on average 1.5570652173913044) internal successors, (573), 375 states have internal predecessors, (573), 78 states have call successors, (78), 30 states have call predecessors, (78), 33 states have return successors, (89), 76 states have call predecessors, (89), 77 states have call successors, (89) [2025-01-09 03:52:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 740 transitions. [2025-01-09 03:52:21,919 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 740 transitions. Word has length 181 [2025-01-09 03:52:21,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:21,919 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 740 transitions. [2025-01-09 03:52:21,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 15.571428571428571) internal successors, (109), 8 states have internal predecessors, (109), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 03:52:21,920 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 740 transitions. [2025-01-09 03:52:21,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 03:52:21,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:21,922 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:21,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:52:21,922 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:21,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:21,922 INFO L85 PathProgramCache]: Analyzing trace with hash -861886760, now seen corresponding path program 1 times [2025-01-09 03:52:21,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:21,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848578212] [2025-01-09 03:52:21,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:21,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:21,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 03:52:21,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 03:52:21,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:21,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:22,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:22,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848578212] [2025-01-09 03:52:22,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848578212] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:22,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737837367] [2025-01-09 03:52:22,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:22,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:22,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:22,015 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:22,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:52:22,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 03:52:22,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 03:52:22,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:22,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:22,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 1235 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:52:22,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:22,329 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:22,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:52:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:22,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737837367] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:52:22,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:52:22,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:52:22,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412792051] [2025-01-09 03:52:22,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:52:22,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:52:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:22,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:52:22,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:52:22,423 INFO L87 Difference]: Start difference. First operand 480 states and 740 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 03:52:22,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:22,571 INFO L93 Difference]: Finished difference Result 1112 states and 1777 transitions. [2025-01-09 03:52:22,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:52:22,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 163 [2025-01-09 03:52:22,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:22,577 INFO L225 Difference]: With dead ends: 1112 [2025-01-09 03:52:22,577 INFO L226 Difference]: Without dead ends: 891 [2025-01-09 03:52:22,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 323 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-01-09 03:52:22,578 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 374 mSDsluCounter, 3205 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 3847 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:22,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 3847 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:52:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2025-01-09 03:52:22,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 867. [2025-01-09 03:52:22,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 676 states have (on average 1.6272189349112427) internal successors, (1100), 683 states have internal predecessors, (1100), 157 states have call successors, (157), 30 states have call predecessors, (157), 33 states have return successors, (178), 155 states have call predecessors, (178), 156 states have call successors, (178) [2025-01-09 03:52:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1435 transitions. [2025-01-09 03:52:22,608 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1435 transitions. Word has length 163 [2025-01-09 03:52:22,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:22,608 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1435 transitions. [2025-01-09 03:52:22,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 03:52:22,608 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1435 transitions. [2025-01-09 03:52:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 03:52:22,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:22,613 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:22,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 03:52:22,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 03:52:22,814 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:22,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:22,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1021741060, now seen corresponding path program 1 times [2025-01-09 03:52:22,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:22,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54740455] [2025-01-09 03:52:22,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:22,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:22,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 03:52:22,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 03:52:22,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:22,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:22,869 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:22,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:22,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54740455] [2025-01-09 03:52:22,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54740455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:22,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:22,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:22,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365511034] [2025-01-09 03:52:22,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:22,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:22,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:22,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:22,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:22,871 INFO L87 Difference]: Start difference. First operand 867 states and 1435 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:22,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:22,900 INFO L93 Difference]: Finished difference Result 2056 states and 3459 transitions. [2025-01-09 03:52:22,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:22,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 170 [2025-01-09 03:52:22,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:22,906 INFO L225 Difference]: With dead ends: 2056 [2025-01-09 03:52:22,906 INFO L226 Difference]: Without dead ends: 1258 [2025-01-09 03:52:22,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:22,909 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 124 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:22,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1238 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:22,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2025-01-09 03:52:22,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1250. [2025-01-09 03:52:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 980 states have (on average 1.6459183673469389) internal successors, (1613), 987 states have internal predecessors, (1613), 236 states have call successors, (236), 30 states have call predecessors, (236), 33 states have return successors, (267), 234 states have call predecessors, (267), 235 states have call successors, (267) [2025-01-09 03:52:22,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 2116 transitions. [2025-01-09 03:52:22,965 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 2116 transitions. Word has length 170 [2025-01-09 03:52:22,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:22,965 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 2116 transitions. [2025-01-09 03:52:22,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:22,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 2116 transitions. [2025-01-09 03:52:22,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 03:52:22,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:22,971 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:22,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:52:22,971 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:22,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:22,971 INFO L85 PathProgramCache]: Analyzing trace with hash -384311376, now seen corresponding path program 1 times [2025-01-09 03:52:22,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:22,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407234642] [2025-01-09 03:52:22,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:22,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:23,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 03:52:23,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 03:52:23,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:23,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:23,033 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:23,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:23,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407234642] [2025-01-09 03:52:23,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407234642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:23,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:23,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:23,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673000294] [2025-01-09 03:52:23,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:23,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:23,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:23,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:23,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:23,034 INFO L87 Difference]: Start difference. First operand 1250 states and 2116 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:23,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:23,070 INFO L93 Difference]: Finished difference Result 2988 states and 5100 transitions. [2025-01-09 03:52:23,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:23,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 171 [2025-01-09 03:52:23,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:23,079 INFO L225 Difference]: With dead ends: 2988 [2025-01-09 03:52:23,079 INFO L226 Difference]: Without dead ends: 1858 [2025-01-09 03:52:23,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:23,084 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 122 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:23,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1216 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:23,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2025-01-09 03:52:23,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1850. [2025-01-09 03:52:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1461 states have (on average 1.6591375770020533) internal successors, (2424), 1468 states have internal predecessors, (2424), 355 states have call successors, (355), 30 states have call predecessors, (355), 33 states have return successors, (386), 353 states have call predecessors, (386), 354 states have call successors, (386) [2025-01-09 03:52:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 3165 transitions. [2025-01-09 03:52:23,151 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 3165 transitions. Word has length 171 [2025-01-09 03:52:23,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:23,152 INFO L471 AbstractCegarLoop]: Abstraction has 1850 states and 3165 transitions. [2025-01-09 03:52:23,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:23,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 3165 transitions. [2025-01-09 03:52:23,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-09 03:52:23,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:23,161 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:23,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:52:23,162 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:23,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:23,162 INFO L85 PathProgramCache]: Analyzing trace with hash 996732839, now seen corresponding path program 1 times [2025-01-09 03:52:23,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:23,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62692143] [2025-01-09 03:52:23,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:23,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:23,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 03:52:23,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 03:52:23,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:23,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:23,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:23,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62692143] [2025-01-09 03:52:23,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62692143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:23,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:23,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:23,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017037788] [2025-01-09 03:52:23,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:23,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:23,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:23,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:23,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:23,213 INFO L87 Difference]: Start difference. First operand 1850 states and 3165 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:23,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:23,264 INFO L93 Difference]: Finished difference Result 4385 states and 7572 transitions. [2025-01-09 03:52:23,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:23,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 191 [2025-01-09 03:52:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:23,277 INFO L225 Difference]: With dead ends: 4385 [2025-01-09 03:52:23,277 INFO L226 Difference]: Without dead ends: 2776 [2025-01-09 03:52:23,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:23,283 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 120 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:23,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1213 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2025-01-09 03:52:23,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 2768. [2025-01-09 03:52:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2768 states, 2217 states have (on average 1.6698240866035183) internal successors, (3702), 2224 states have internal predecessors, (3702), 517 states have call successors, (517), 30 states have call predecessors, (517), 33 states have return successors, (564), 515 states have call predecessors, (564), 516 states have call successors, (564) [2025-01-09 03:52:23,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 4783 transitions. [2025-01-09 03:52:23,367 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 4783 transitions. Word has length 191 [2025-01-09 03:52:23,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:23,367 INFO L471 AbstractCegarLoop]: Abstraction has 2768 states and 4783 transitions. [2025-01-09 03:52:23,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:23,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 4783 transitions. [2025-01-09 03:52:23,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-09 03:52:23,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:23,380 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:23,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:52:23,380 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:23,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:23,381 INFO L85 PathProgramCache]: Analyzing trace with hash -307618220, now seen corresponding path program 1 times [2025-01-09 03:52:23,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:23,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811624440] [2025-01-09 03:52:23,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:23,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:23,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 03:52:23,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 03:52:23,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:23,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:23,459 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:23,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:23,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811624440] [2025-01-09 03:52:23,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811624440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:23,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:23,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:23,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130217843] [2025-01-09 03:52:23,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:23,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:23,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:23,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:23,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:23,461 INFO L87 Difference]: Start difference. First operand 2768 states and 4783 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:23,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:23,543 INFO L93 Difference]: Finished difference Result 6588 states and 11478 transitions. [2025-01-09 03:52:23,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:23,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 192 [2025-01-09 03:52:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:23,566 INFO L225 Difference]: With dead ends: 6588 [2025-01-09 03:52:23,566 INFO L226 Difference]: Without dead ends: 4258 [2025-01-09 03:52:23,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:23,576 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 118 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:23,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1213 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:23,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4258 states. [2025-01-09 03:52:23,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4258 to 4250. [2025-01-09 03:52:23,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4250 states, 3454 states have (on average 1.677475390851187) internal successors, (5794), 3461 states have internal predecessors, (5794), 762 states have call successors, (762), 30 states have call predecessors, (762), 33 states have return successors, (835), 760 states have call predecessors, (835), 761 states have call successors, (835) [2025-01-09 03:52:23,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 7391 transitions. [2025-01-09 03:52:23,732 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 7391 transitions. Word has length 192 [2025-01-09 03:52:23,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:23,732 INFO L471 AbstractCegarLoop]: Abstraction has 4250 states and 7391 transitions. [2025-01-09 03:52:23,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 7391 transitions. [2025-01-09 03:52:23,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 03:52:23,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:23,749 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:23,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:52:23,749 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:23,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:23,750 INFO L85 PathProgramCache]: Analyzing trace with hash 133012570, now seen corresponding path program 1 times [2025-01-09 03:52:23,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:23,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572801987] [2025-01-09 03:52:23,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:23,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:23,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 03:52:23,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 03:52:23,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:23,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:23,795 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:23,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:23,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572801987] [2025-01-09 03:52:23,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572801987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:23,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:23,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:23,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723679591] [2025-01-09 03:52:23,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:23,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:23,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:23,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:23,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:23,796 INFO L87 Difference]: Start difference. First operand 4250 states and 7391 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:23,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:23,959 INFO L93 Difference]: Finished difference Result 10527 states and 18413 transitions. [2025-01-09 03:52:23,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:23,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 174 [2025-01-09 03:52:23,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:24,004 INFO L225 Difference]: With dead ends: 10527 [2025-01-09 03:52:24,004 INFO L226 Difference]: Without dead ends: 6936 [2025-01-09 03:52:24,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:24,021 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 116 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:24,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1229 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:24,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6936 states. [2025-01-09 03:52:24,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6936 to 6928. [2025-01-09 03:52:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6928 states, 5639 states have (on average 1.6747650292605072) internal successors, (9444), 5646 states have internal predecessors, (9444), 1255 states have call successors, (1255), 30 states have call predecessors, (1255), 33 states have return successors, (1372), 1253 states have call predecessors, (1372), 1254 states have call successors, (1372) [2025-01-09 03:52:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6928 states to 6928 states and 12071 transitions. [2025-01-09 03:52:24,292 INFO L78 Accepts]: Start accepts. Automaton has 6928 states and 12071 transitions. Word has length 174 [2025-01-09 03:52:24,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:24,294 INFO L471 AbstractCegarLoop]: Abstraction has 6928 states and 12071 transitions. [2025-01-09 03:52:24,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:24,295 INFO L276 IsEmpty]: Start isEmpty. Operand 6928 states and 12071 transitions. [2025-01-09 03:52:24,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-09 03:52:24,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:24,340 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:24,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:52:24,340 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:24,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:24,340 INFO L85 PathProgramCache]: Analyzing trace with hash -235222704, now seen corresponding path program 1 times [2025-01-09 03:52:24,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:24,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678289230] [2025-01-09 03:52:24,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:24,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:24,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 03:52:24,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 03:52:24,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:24,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:24,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:24,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678289230] [2025-01-09 03:52:24,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678289230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:24,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:24,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:24,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055610513] [2025-01-09 03:52:24,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:24,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:24,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:24,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:24,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:24,405 INFO L87 Difference]: Start difference. First operand 6928 states and 12071 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:24,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:24,604 INFO L93 Difference]: Finished difference Result 17534 states and 30741 transitions. [2025-01-09 03:52:24,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:24,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 194 [2025-01-09 03:52:24,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:24,648 INFO L225 Difference]: With dead ends: 17534 [2025-01-09 03:52:24,648 INFO L226 Difference]: Without dead ends: 11626 [2025-01-09 03:52:24,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:24,672 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 114 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:24,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1218 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:24,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11626 states. [2025-01-09 03:52:25,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11626 to 11618. [2025-01-09 03:52:25,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11618 states, 9507 states have (on average 1.6753970758388557) internal successors, (15928), 9514 states have internal predecessors, (15928), 2077 states have call successors, (2077), 30 states have call predecessors, (2077), 33 states have return successors, (2272), 2075 states have call predecessors, (2272), 2076 states have call successors, (2272) [2025-01-09 03:52:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11618 states to 11618 states and 20277 transitions. [2025-01-09 03:52:25,289 INFO L78 Accepts]: Start accepts. Automaton has 11618 states and 20277 transitions. Word has length 194 [2025-01-09 03:52:25,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:25,290 INFO L471 AbstractCegarLoop]: Abstraction has 11618 states and 20277 transitions. [2025-01-09 03:52:25,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 11618 states and 20277 transitions. [2025-01-09 03:52:25,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 03:52:25,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:25,333 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:25,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:52:25,333 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:25,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:25,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1310753623, now seen corresponding path program 1 times [2025-01-09 03:52:25,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:25,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354409125] [2025-01-09 03:52:25,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:25,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:25,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 03:52:25,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 03:52:25,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:25,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:25,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:25,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354409125] [2025-01-09 03:52:25,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354409125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:25,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:25,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:25,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919813857] [2025-01-09 03:52:25,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:25,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:25,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:25,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:25,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:25,391 INFO L87 Difference]: Start difference. First operand 11618 states and 20277 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:25,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:25,733 INFO L93 Difference]: Finished difference Result 27729 states and 48347 transitions. [2025-01-09 03:52:25,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:25,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 195 [2025-01-09 03:52:25,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:25,805 INFO L225 Difference]: With dead ends: 27729 [2025-01-09 03:52:25,805 INFO L226 Difference]: Without dead ends: 18053 [2025-01-09 03:52:25,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:25,839 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 112 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 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-01-09 03:52:25,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1198 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:25,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18053 states. [2025-01-09 03:52:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18053 to 18045. [2025-01-09 03:52:26,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18045 states, 14731 states have (on average 1.6514832665806802) internal successors, (24328), 14738 states have internal predecessors, (24328), 3280 states have call successors, (3280), 30 states have call predecessors, (3280), 33 states have return successors, (3619), 3278 states have call predecessors, (3619), 3279 states have call successors, (3619) [2025-01-09 03:52:26,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18045 states to 18045 states and 31227 transitions. [2025-01-09 03:52:26,716 INFO L78 Accepts]: Start accepts. Automaton has 18045 states and 31227 transitions. Word has length 195 [2025-01-09 03:52:26,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:26,717 INFO L471 AbstractCegarLoop]: Abstraction has 18045 states and 31227 transitions. [2025-01-09 03:52:26,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 18045 states and 31227 transitions. [2025-01-09 03:52:26,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 03:52:26,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:26,774 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:26,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:52:26,774 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:26,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:26,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1742727914, now seen corresponding path program 1 times [2025-01-09 03:52:26,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:26,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378413855] [2025-01-09 03:52:26,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:26,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:26,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 03:52:26,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 03:52:26,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:26,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:26,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:26,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378413855] [2025-01-09 03:52:26,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378413855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:26,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:26,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:26,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425088358] [2025-01-09 03:52:26,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:26,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:26,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:26,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:26,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:26,843 INFO L87 Difference]: Start difference. First operand 18045 states and 31227 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:27,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:27,420 INFO L93 Difference]: Finished difference Result 47711 states and 82871 transitions. [2025-01-09 03:52:27,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:27,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 177 [2025-01-09 03:52:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:27,562 INFO L225 Difference]: With dead ends: 47711 [2025-01-09 03:52:27,562 INFO L226 Difference]: Without dead ends: 32186 [2025-01-09 03:52:27,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:27,613 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 110 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:27,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1216 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:27,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32186 states. [2025-01-09 03:52:28,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32186 to 32178. [2025-01-09 03:52:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32178 states, 26414 states have (on average 1.6480654198531082) internal successors, (43532), 26421 states have internal predecessors, (43532), 5730 states have call successors, (5730), 30 states have call predecessors, (5730), 33 states have return successors, (6343), 5728 states have call predecessors, (6343), 5729 states have call successors, (6343) [2025-01-09 03:52:28,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32178 states to 32178 states and 55605 transitions. [2025-01-09 03:52:28,709 INFO L78 Accepts]: Start accepts. Automaton has 32178 states and 55605 transitions. Word has length 177 [2025-01-09 03:52:28,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:28,709 INFO L471 AbstractCegarLoop]: Abstraction has 32178 states and 55605 transitions. [2025-01-09 03:52:28,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 32178 states and 55605 transitions. [2025-01-09 03:52:28,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 03:52:28,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:28,774 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:28,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:52:28,775 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:28,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:28,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1419476337, now seen corresponding path program 1 times [2025-01-09 03:52:28,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:28,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062284438] [2025-01-09 03:52:28,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:28,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:28,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 03:52:28,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 03:52:28,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:28,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:28,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:28,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062284438] [2025-01-09 03:52:28,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062284438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:28,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:28,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:28,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670854198] [2025-01-09 03:52:28,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:28,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:28,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:28,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:28,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:28,830 INFO L87 Difference]: Start difference. First operand 32178 states and 55605 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:30,192 INFO L93 Difference]: Finished difference Result 87773 states and 152138 transitions. [2025-01-09 03:52:30,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:30,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 197 [2025-01-09 03:52:30,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:30,452 INFO L225 Difference]: With dead ends: 87773 [2025-01-09 03:52:30,453 INFO L226 Difference]: Without dead ends: 58954 [2025-01-09 03:52:30,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:30,548 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 108 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:30,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1216 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58954 states. [2025-01-09 03:52:32,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58954 to 58946. [2025-01-09 03:52:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58946 states, 48669 states have (on average 1.643469148739444) internal successors, (79986), 48676 states have internal predecessors, (79986), 10243 states have call successors, (10243), 30 states have call predecessors, (10243), 33 states have return successors, (11388), 10241 states have call predecessors, (11388), 10242 states have call successors, (11388) [2025-01-09 03:52:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58946 states to 58946 states and 101617 transitions. [2025-01-09 03:52:32,802 INFO L78 Accepts]: Start accepts. Automaton has 58946 states and 101617 transitions. Word has length 197 [2025-01-09 03:52:32,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:32,802 INFO L471 AbstractCegarLoop]: Abstraction has 58946 states and 101617 transitions. [2025-01-09 03:52:32,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 58946 states and 101617 transitions. [2025-01-09 03:52:32,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 03:52:32,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:32,918 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:32,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:52:32,919 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:32,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:32,919 INFO L85 PathProgramCache]: Analyzing trace with hash -594317297, now seen corresponding path program 1 times [2025-01-09 03:52:32,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:32,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864644443] [2025-01-09 03:52:32,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:32,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:32,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 03:52:32,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 03:52:32,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:32,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:32,972 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:32,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:32,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864644443] [2025-01-09 03:52:32,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864644443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:32,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:32,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:32,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411091384] [2025-01-09 03:52:32,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:32,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:32,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:32,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:32,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:32,974 INFO L87 Difference]: Start difference. First operand 58946 states and 101617 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:34,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:34,953 INFO L93 Difference]: Finished difference Result 110345 states and 190628 transitions. [2025-01-09 03:52:34,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:34,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 198 [2025-01-09 03:52:34,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:35,702 INFO L225 Difference]: With dead ends: 110345 [2025-01-09 03:52:35,702 INFO L226 Difference]: Without dead ends: 110124 [2025-01-09 03:52:35,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:35,772 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 103 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:35,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1222 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:35,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110124 states. [2025-01-09 03:52:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110124 to 110116. [2025-01-09 03:52:39,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110116 states, 91471 states have (on average 1.63773217741142) internal successors, (149805), 91478 states have internal predecessors, (149805), 18611 states have call successors, (18611), 30 states have call predecessors, (18611), 33 states have return successors, (20802), 18609 states have call predecessors, (20802), 18610 states have call successors, (20802) [2025-01-09 03:52:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110116 states to 110116 states and 189218 transitions. [2025-01-09 03:52:39,745 INFO L78 Accepts]: Start accepts. Automaton has 110116 states and 189218 transitions. Word has length 198 [2025-01-09 03:52:39,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:39,746 INFO L471 AbstractCegarLoop]: Abstraction has 110116 states and 189218 transitions. [2025-01-09 03:52:39,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:39,746 INFO L276 IsEmpty]: Start isEmpty. Operand 110116 states and 189218 transitions. [2025-01-09 03:52:39,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 03:52:39,968 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:39,968 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:39,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:52:39,968 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:39,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:39,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1451763765, now seen corresponding path program 1 times [2025-01-09 03:52:39,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:39,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733977920] [2025-01-09 03:52:39,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:39,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:39,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 03:52:40,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 03:52:40,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:40,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 03:52:40,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:40,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733977920] [2025-01-09 03:52:40,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733977920] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:40,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44770766] [2025-01-09 03:52:40,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:40,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:40,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:40,690 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:40,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 03:52:40,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 03:52:40,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 03:52:40,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:40,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:40,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 03:52:40,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 03:52:41,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:52:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 03:52:41,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44770766] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:52:41,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:52:41,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2025-01-09 03:52:41,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129540407] [2025-01-09 03:52:41,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:52:41,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 03:52:41,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:41,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 03:52:41,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-01-09 03:52:41,496 INFO L87 Difference]: Start difference. First operand 110116 states and 189218 transitions. Second operand has 28 states, 26 states have (on average 10.5) internal successors, (273), 24 states have internal predecessors, (273), 9 states have call successors, (58), 8 states have call predecessors, (58), 12 states have return successors, (51), 11 states have call predecessors, (51), 9 states have call successors, (51) [2025-01-09 03:52:55,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:55,375 INFO L93 Difference]: Finished difference Result 439049 states and 778317 transitions. [2025-01-09 03:52:55,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-01-09 03:52:55,376 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 10.5) internal successors, (273), 24 states have internal predecessors, (273), 9 states have call successors, (58), 8 states have call predecessors, (58), 12 states have return successors, (51), 11 states have call predecessors, (51), 9 states have call successors, (51) Word has length 180 [2025-01-09 03:52:55,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:57,899 INFO L225 Difference]: With dead ends: 439049 [2025-01-09 03:52:57,899 INFO L226 Difference]: Without dead ends: 438832 [2025-01-09 03:52:58,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3323 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1330, Invalid=10880, Unknown=0, NotChecked=0, Total=12210 [2025-01-09 03:52:58,089 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 7523 mSDsluCounter, 5352 mSDsCounter, 0 mSdLazyCounter, 12363 mSolverCounterSat, 2390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7593 SdHoareTripleChecker+Valid, 5607 SdHoareTripleChecker+Invalid, 14753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2390 IncrementalHoareTripleChecker+Valid, 12363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:58,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7593 Valid, 5607 Invalid, 14753 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2390 Valid, 12363 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-01-09 03:52:58,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438832 states.