./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec4_productSimulator.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec4_productSimulator.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cf397912a53dab4d44f4df9c274fc7c69b1023a0a0a29a356bc73a744537daa6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:43:29,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:43:29,559 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:43:29,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:43:29,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:43:29,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:43:29,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:43:29,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:43:29,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:43:29,589 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:43:29,590 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:43:29,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:43:29,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:43:29,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:43:29,591 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:43:29,591 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:43:29,591 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:43:29,591 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:43:29,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:43:29,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:43:29,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:43:29,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:43:29,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:43:29,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:43:29,591 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:43:29,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:43:29,591 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:43:29,591 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:43:29,592 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:43:29,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:43:29,592 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:43:29,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:43:29,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:43:29,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:43:29,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:43:29,592 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:43:29,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:43:29,592 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:43:29,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:43:29,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:43:29,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:43:29,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:43:29,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:43:29,592 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cf397912a53dab4d44f4df9c274fc7c69b1023a0a0a29a356bc73a744537daa6 [2025-03-16 18:43:29,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:43:29,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:43:29,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:43:29,809 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:43:29,810 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:43:29,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec4_productSimulator.cil.c [2025-03-16 18:43:30,928 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3db6416a8/99438607b5f64c319c04202d4b1284cd/FLAG3cbd44919 [2025-03-16 18:43:31,284 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:43:31,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_productSimulator.cil.c [2025-03-16 18:43:31,303 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3db6416a8/99438607b5f64c319c04202d4b1284cd/FLAG3cbd44919 [2025-03-16 18:43:31,500 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3db6416a8/99438607b5f64c319c04202d4b1284cd [2025-03-16 18:43:31,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:43:31,503 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:43:31,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:43:31,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:43:31,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:43:31,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:43:31" (1/1) ... [2025-03-16 18:43:31,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d9de218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:43:31, skipping insertion in model container [2025-03-16 18:43:31,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:43:31" (1/1) ... [2025-03-16 18:43:31,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:43:31,788 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_productSimulator.cil.c[18883,18896] [2025-03-16 18:43:31,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:43:31,958 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:43:31,965 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-03-16 18:43:31,967 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [335] [2025-03-16 18:43:31,967 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [353] [2025-03-16 18:43:31,967 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [938] [2025-03-16 18:43:31,967 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [947] [2025-03-16 18:43:31,967 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2018] [2025-03-16 18:43:31,967 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2128] [2025-03-16 18:43:31,967 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2527] [2025-03-16 18:43:31,967 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2876] [2025-03-16 18:43:31,968 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3080] [2025-03-16 18:43:31,968 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [3446] [2025-03-16 18:43:32,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_productSimulator.cil.c[18883,18896] [2025-03-16 18:43:32,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:43:32,096 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:43:32,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:43:32 WrapperNode [2025-03-16 18:43:32,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:43:32,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:43:32,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:43:32,098 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:43:32,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:43:32" (1/1) ... [2025-03-16 18:43:32,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:43:32" (1/1) ... [2025-03-16 18:43:32,162 INFO L138 Inliner]: procedures = 151, calls = 263, calls flagged for inlining = 67, calls inlined = 64, statements flattened = 1314 [2025-03-16 18:43:32,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:43:32,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:43:32,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:43:32,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:43:32,175 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:43:32" (1/1) ... [2025-03-16 18:43:32,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:43:32" (1/1) ... [2025-03-16 18:43:32,184 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:43:32" (1/1) ... [2025-03-16 18:43:32,222 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-16 18:43:32,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:43:32" (1/1) ... [2025-03-16 18:43:32,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:43:32" (1/1) ... [2025-03-16 18:43:32,250 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:43:32" (1/1) ... [2025-03-16 18:43:32,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:43:32" (1/1) ... [2025-03-16 18:43:32,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:43:32" (1/1) ... [2025-03-16 18:43:32,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:43:32" (1/1) ... [2025-03-16 18:43:32,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:43:32,281 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:43:32,282 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:43:32,282 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:43:32,283 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:43:32" (1/1) ... [2025-03-16 18:43:32,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:43:32,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:43:32,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 18:43:32,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 18:43:32,335 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-16 18:43:32,335 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-16 18:43:32,335 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-03-16 18:43:32,335 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-03-16 18:43:32,335 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-03-16 18:43:32,335 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-03-16 18:43:32,335 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-16 18:43:32,335 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-16 18:43:32,335 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-16 18:43:32,335 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-16 18:43:32,335 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-16 18:43:32,335 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-16 18:43:32,335 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-16 18:43:32,335 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-16 18:43:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-03-16 18:43:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-03-16 18:43:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-16 18:43:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-16 18:43:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-03-16 18:43:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-03-16 18:43:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-16 18:43:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-16 18:43:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-16 18:43:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-16 18:43:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-16 18:43:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-16 18:43:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-03-16 18:43:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-03-16 18:43:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-03-16 18:43:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-03-16 18:43:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-16 18:43:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-16 18:43:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-16 18:43:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-16 18:43:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-16 18:43:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-16 18:43:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-03-16 18:43:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-03-16 18:43:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-16 18:43:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-16 18:43:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-16 18:43:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-16 18:43:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-16 18:43:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-16 18:43:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-03-16 18:43:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-03-16 18:43:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:43:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-16 18:43:32,337 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-16 18:43:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-16 18:43:32,337 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-16 18:43:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-03-16 18:43:32,337 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-03-16 18:43:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-03-16 18:43:32,337 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-03-16 18:43:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-03-16 18:43:32,337 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-03-16 18:43:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-16 18:43:32,337 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-16 18:43:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-16 18:43:32,337 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-16 18:43:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-16 18:43:32,337 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-16 18:43:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-16 18:43:32,337 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-16 18:43:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-16 18:43:32,337 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-16 18:43:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-16 18:43:32,337 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-16 18:43:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-16 18:43:32,337 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-16 18:43:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-03-16 18:43:32,337 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-03-16 18:43:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-03-16 18:43:32,337 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-03-16 18:43:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-16 18:43:32,337 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-16 18:43:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-16 18:43:32,337 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-16 18:43:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:43:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 18:43:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 18:43:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 18:43:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-16 18:43:32,339 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-16 18:43:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-03-16 18:43:32,339 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-03-16 18:43:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-03-16 18:43:32,339 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-03-16 18:43:32,339 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-16 18:43:32,339 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-16 18:43:32,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:43:32,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:43:32,558 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:43:32,561 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:43:32,596 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3015: #res := ~retValue_acc~37; [2025-03-16 18:43:32,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2434: #res := ~retValue_acc~33; [2025-03-16 18:43:32,617 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L822: #res := ~retValue_acc~5; [2025-03-16 18:43:32,631 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1560: #res := ~retValue_acc~15; [2025-03-16 18:43:32,685 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1104: #res := ~retValue_acc~9; [2025-03-16 18:43:32,708 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2171-1: getEmailId_#res#1 := getEmailId_~retValue_acc~26#1; [2025-03-16 18:43:32,746 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2397: #res := ~retValue_acc~32; [2025-03-16 18:43:32,771 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2245: #res := ~retValue_acc~28; [2025-03-16 18:43:32,828 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3035-1: isReadable__role__Encrypt_#res#1 := isReadable__role__Encrypt_~retValue_acc~38#1; [2025-03-16 18:43:32,829 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3053: #res#1 := ~retValue_acc~39#1; [2025-03-16 18:43:32,884 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1652: #res#1 := ~retValue_acc~17#1; [2025-03-16 18:43:32,885 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1607-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~16#1; [2025-03-16 18:43:32,927 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1876: #res := ~retValue_acc~20; [2025-03-16 18:43:32,934 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3077-1: createEmail_#res#1 := createEmail_~retValue_acc~41#1; [2025-03-16 18:43:32,942 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2360: #res := ~retValue_acc~31; [2025-03-16 18:43:32,987 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1995-1: getClientId_#res#1 := getClientId_~retValue_acc~22#1; [2025-03-16 18:43:33,020 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1948-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~21#1; [2025-03-16 18:43:33,021 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2508-1: isVerified_#res#1 := isVerified_~retValue_acc~35#1; [2025-03-16 18:43:33,028 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2471: #res := ~retValue_acc~34; [2025-03-16 18:43:33,056 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2030: #res := ~retValue_acc~23; [2025-03-16 18:43:33,080 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1430: #res := ~retValue_acc~13; [2025-03-16 18:43:33,099 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1513-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~14#1; [2025-03-16 18:43:33,346 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L779-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~2#1; [2025-03-16 18:43:33,346 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L797-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~4#1; [2025-03-16 18:43:33,346 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~19#1; [2025-03-16 18:43:33,347 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2125-1: valid_product_#res#1 := valid_product_~retValue_acc~24#1; [2025-03-16 18:43:33,347 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L788-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~3#1; [2025-03-16 18:43:33,347 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1715-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~18#1; [2025-03-16 18:43:33,353 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2208: #res := ~retValue_acc~27; [2025-03-16 18:43:33,511 INFO L? ?]: Removed 604 outVars from TransFormulas that were not future-live. [2025-03-16 18:43:33,511 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:43:33,538 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:43:33,539 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:43:33,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:43:33 BoogieIcfgContainer [2025-03-16 18:43:33,539 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:43:33,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:43:33,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:43:33,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:43:33,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:43:31" (1/3) ... [2025-03-16 18:43:33,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778c720c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:43:33, skipping insertion in model container [2025-03-16 18:43:33,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:43:32" (2/3) ... [2025-03-16 18:43:33,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778c720c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:43:33, skipping insertion in model container [2025-03-16 18:43:33,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:43:33" (3/3) ... [2025-03-16 18:43:33,548 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec4_productSimulator.cil.c [2025-03-16 18:43:33,560 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:43:33,563 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec4_productSimulator.cil.c that has 44 procedures, 585 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 18:43:33,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:43:33,647 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;@75afc6ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:43:33,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:43:33,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 585 states, 430 states have (on average 1.5348837209302326) internal successors, (660), 450 states have internal predecessors, (660), 110 states have call successors, (110), 43 states have call predecessors, (110), 43 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-16 18:43:33,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 18:43:33,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:33,669 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:33,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:33,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:33,675 INFO L85 PathProgramCache]: Analyzing trace with hash -982571900, now seen corresponding path program 1 times [2025-03-16 18:43:33,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:33,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399731031] [2025-03-16 18:43:33,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:33,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:33,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 18:43:33,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 18:43:33,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:33,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:34,211 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-16 18:43:34,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:34,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399731031] [2025-03-16 18:43:34,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399731031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:34,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:43:34,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 18:43:34,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572498309] [2025-03-16 18:43:34,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:34,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:43:34,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:34,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:43:34,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:43:34,238 INFO L87 Difference]: Start difference. First operand has 585 states, 430 states have (on average 1.5348837209302326) internal successors, (660), 450 states have internal predecessors, (660), 110 states have call successors, (110), 43 states have call predecessors, (110), 43 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-16 18:43:34,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:34,407 INFO L93 Difference]: Finished difference Result 1137 states and 1718 transitions. [2025-03-16 18:43:34,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:43:34,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 129 [2025-03-16 18:43:34,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:34,426 INFO L225 Difference]: With dead ends: 1137 [2025-03-16 18:43:34,426 INFO L226 Difference]: Without dead ends: 581 [2025-03-16 18:43:34,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:43:34,436 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 0 mSDsluCounter, 2612 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3487 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:34,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3487 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:43:34,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-16 18:43:34,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 581. [2025-03-16 18:43:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 427 states have (on average 1.5128805620608898) internal successors, (646), 446 states have internal predecessors, (646), 110 states have call successors, (110), 43 states have call predecessors, (110), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-03-16 18:43:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 865 transitions. [2025-03-16 18:43:34,517 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 865 transitions. Word has length 129 [2025-03-16 18:43:34,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:34,519 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 865 transitions. [2025-03-16 18:43:34,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-16 18:43:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 865 transitions. [2025-03-16 18:43:34,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 18:43:34,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:34,525 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:34,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 18:43:34,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:34,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:34,526 INFO L85 PathProgramCache]: Analyzing trace with hash -627341398, now seen corresponding path program 1 times [2025-03-16 18:43:34,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:34,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584295937] [2025-03-16 18:43:34,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:34,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:34,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 18:43:34,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 18:43:34,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:34,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:34,722 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-16 18:43:34,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:34,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584295937] [2025-03-16 18:43:34,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584295937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:34,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:43:34,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 18:43:34,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732674572] [2025-03-16 18:43:34,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:34,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:43:34,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:34,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:43:34,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:43:34,725 INFO L87 Difference]: Start difference. First operand 581 states and 865 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-16 18:43:34,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:34,792 INFO L93 Difference]: Finished difference Result 1135 states and 1704 transitions. [2025-03-16 18:43:34,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:43:34,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 134 [2025-03-16 18:43:34,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:34,801 INFO L225 Difference]: With dead ends: 1135 [2025-03-16 18:43:34,801 INFO L226 Difference]: Without dead ends: 582 [2025-03-16 18:43:34,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:43:34,804 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 832 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:34,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 870 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:43:34,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-03-16 18:43:34,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2025-03-16 18:43:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 429 states have (on average 1.5011655011655012) internal successors, (644), 446 states have internal predecessors, (644), 108 states have call successors, (108), 44 states have call predecessors, (108), 44 states have return successors, (107), 106 states have call predecessors, (107), 107 states have call successors, (107) [2025-03-16 18:43:34,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 859 transitions. [2025-03-16 18:43:34,853 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 859 transitions. Word has length 134 [2025-03-16 18:43:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:34,853 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 859 transitions. [2025-03-16 18:43:34,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-16 18:43:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 859 transitions. [2025-03-16 18:43:34,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 18:43:34,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:34,856 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:34,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 18:43:34,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:34,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:34,859 INFO L85 PathProgramCache]: Analyzing trace with hash 158978496, now seen corresponding path program 1 times [2025-03-16 18:43:34,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:34,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453699363] [2025-03-16 18:43:34,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:34,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:34,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 18:43:34,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 18:43:34,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:34,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:34,969 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-16 18:43:34,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:34,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453699363] [2025-03-16 18:43:34,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453699363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:34,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:43:34,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 18:43:34,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228445361] [2025-03-16 18:43:34,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:34,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:43:34,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:34,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:43:34,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:43:34,970 INFO L87 Difference]: Start difference. First operand 582 states and 859 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-16 18:43:35,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:35,030 INFO L93 Difference]: Finished difference Result 1129 states and 1683 transitions. [2025-03-16 18:43:35,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:43:35,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 144 [2025-03-16 18:43:35,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:35,037 INFO L225 Difference]: With dead ends: 1129 [2025-03-16 18:43:35,037 INFO L226 Difference]: Without dead ends: 580 [2025-03-16 18:43:35,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:43:35,043 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 812 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:35,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 882 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:43:35,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-16 18:43:35,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2025-03-16 18:43:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 429 states have (on average 1.494172494172494) internal successors, (641), 444 states have internal predecessors, (641), 106 states have call successors, (106), 44 states have call predecessors, (106), 44 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-16 18:43:35,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 852 transitions. [2025-03-16 18:43:35,078 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 852 transitions. Word has length 144 [2025-03-16 18:43:35,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:35,079 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 852 transitions. [2025-03-16 18:43:35,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-16 18:43:35,079 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 852 transitions. [2025-03-16 18:43:35,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 18:43:35,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:35,083 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:35,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 18:43:35,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:35,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:35,086 INFO L85 PathProgramCache]: Analyzing trace with hash -879165391, now seen corresponding path program 1 times [2025-03-16 18:43:35,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:35,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114032056] [2025-03-16 18:43:35,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:35,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:35,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 18:43:35,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 18:43:35,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:35,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:35,200 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-16 18:43:35,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:35,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114032056] [2025-03-16 18:43:35,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114032056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:35,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:43:35,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 18:43:35,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968914784] [2025-03-16 18:43:35,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:35,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:43:35,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:35,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:43:35,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:43:35,202 INFO L87 Difference]: Start difference. First operand 580 states and 852 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-16 18:43:35,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:35,286 INFO L93 Difference]: Finished difference Result 1120 states and 1649 transitions. [2025-03-16 18:43:35,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:43:35,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2025-03-16 18:43:35,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:35,291 INFO L225 Difference]: With dead ends: 1120 [2025-03-16 18:43:35,291 INFO L226 Difference]: Without dead ends: 583 [2025-03-16 18:43:35,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:43:35,293 INFO L435 NwaCegarLoop]: 827 mSDtfsCounter, 792 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:35,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 865 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:43:35,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-03-16 18:43:35,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 577. [2025-03-16 18:43:35,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 429 states have (on average 1.4685314685314685) internal successors, (630), 439 states have internal predecessors, (630), 103 states have call successors, (103), 44 states have call predecessors, (103), 44 states have return successors, (102), 101 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-16 18:43:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 835 transitions. [2025-03-16 18:43:35,328 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 835 transitions. Word has length 145 [2025-03-16 18:43:35,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:35,329 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 835 transitions. [2025-03-16 18:43:35,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-16 18:43:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 835 transitions. [2025-03-16 18:43:35,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-16 18:43:35,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:35,332 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:35,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 18:43:35,332 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:35,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:35,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2067535661, now seen corresponding path program 1 times [2025-03-16 18:43:35,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:35,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205975397] [2025-03-16 18:43:35,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:35,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:35,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-16 18:43:35,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-16 18:43:35,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:35,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-16 18:43:35,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:35,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205975397] [2025-03-16 18:43:35,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205975397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:43:35,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369011661] [2025-03-16 18:43:35,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:35,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:43:35,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:43:35,597 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:43:35,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 18:43:35,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-16 18:43:35,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-16 18:43:35,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:35,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:35,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 1348 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 18:43:35,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:43:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-16 18:43:35,953 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:43:35,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369011661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:35,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:43:35,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-16 18:43:35,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396710160] [2025-03-16 18:43:35,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:35,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:43:35,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:35,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:43:35,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:43:35,959 INFO L87 Difference]: Start difference. First operand 577 states and 835 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 18:43:36,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:36,008 INFO L93 Difference]: Finished difference Result 896 states and 1278 transitions. [2025-03-16 18:43:36,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:43:36,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 163 [2025-03-16 18:43:36,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:36,013 INFO L225 Difference]: With dead ends: 896 [2025-03-16 18:43:36,015 INFO L226 Difference]: Without dead ends: 578 [2025-03-16 18:43:36,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:43:36,016 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 0 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:36,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1662 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:43:36,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-16 18:43:36,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2025-03-16 18:43:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 430 states have (on average 1.4674418604651163) internal successors, (631), 440 states have internal predecessors, (631), 103 states have call successors, (103), 44 states have call predecessors, (103), 44 states have return successors, (102), 101 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-16 18:43:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 836 transitions. [2025-03-16 18:43:36,042 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 836 transitions. Word has length 163 [2025-03-16 18:43:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:36,043 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 836 transitions. [2025-03-16 18:43:36,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 18:43:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 836 transitions. [2025-03-16 18:43:36,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-16 18:43:36,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:36,045 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:36,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 18:43:36,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:43:36,249 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:36,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:36,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1744175325, now seen corresponding path program 1 times [2025-03-16 18:43:36,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:36,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735032743] [2025-03-16 18:43:36,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:36,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:36,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-16 18:43:36,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-16 18:43:36,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:36,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:36,464 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-16 18:43:36,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:36,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735032743] [2025-03-16 18:43:36,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735032743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:43:36,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463891688] [2025-03-16 18:43:36,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:36,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:43:36,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:43:36,467 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:43:36,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 18:43:36,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-16 18:43:36,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-16 18:43:36,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:36,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:36,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 1361 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 18:43:36,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:43:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-16 18:43:36,797 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:43:36,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463891688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:36,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:43:36,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-16 18:43:36,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328028789] [2025-03-16 18:43:36,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:36,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:43:36,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:36,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:43:36,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:43:36,798 INFO L87 Difference]: Start difference. First operand 578 states and 836 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 18:43:36,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:36,832 INFO L93 Difference]: Finished difference Result 1177 states and 1734 transitions. [2025-03-16 18:43:36,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:43:36,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 169 [2025-03-16 18:43:36,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:36,837 INFO L225 Difference]: With dead ends: 1177 [2025-03-16 18:43:36,837 INFO L226 Difference]: Without dead ends: 672 [2025-03-16 18:43:36,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:43:36,839 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 162 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:36,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1632 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:43:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-16 18:43:36,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 664. [2025-03-16 18:43:36,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 502 states have (on average 1.4840637450199203) internal successors, (745), 512 states have internal predecessors, (745), 117 states have call successors, (117), 44 states have call predecessors, (117), 44 states have return successors, (116), 115 states have call predecessors, (116), 116 states have call successors, (116) [2025-03-16 18:43:36,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 978 transitions. [2025-03-16 18:43:36,867 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 978 transitions. Word has length 169 [2025-03-16 18:43:36,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:36,868 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 978 transitions. [2025-03-16 18:43:36,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 18:43:36,868 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 978 transitions. [2025-03-16 18:43:36,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-16 18:43:36,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:36,870 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:36,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 18:43:37,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-16 18:43:37,075 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:37,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:37,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1689893898, now seen corresponding path program 1 times [2025-03-16 18:43:37,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:37,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434807718] [2025-03-16 18:43:37,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:37,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:37,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-16 18:43:37,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-16 18:43:37,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:37,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:37,273 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-16 18:43:37,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:37,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434807718] [2025-03-16 18:43:37,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434807718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:43:37,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583290743] [2025-03-16 18:43:37,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:37,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:43:37,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:43:37,277 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:43:37,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 18:43:37,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-16 18:43:37,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-16 18:43:37,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:37,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:37,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 1366 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 18:43:37,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:43:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-16 18:43:37,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:43:37,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583290743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:37,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:43:37,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-16 18:43:37,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146287253] [2025-03-16 18:43:37,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:37,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:43:37,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:37,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:43:37,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-16 18:43:37,684 INFO L87 Difference]: Start difference. First operand 664 states and 978 transitions. Second operand has 8 states, 6 states have (on average 16.0) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 18:43:37,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:37,810 INFO L93 Difference]: Finished difference Result 1278 states and 1896 transitions. [2025-03-16 18:43:37,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:43:37,811 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 16.0) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 170 [2025-03-16 18:43:37,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:37,815 INFO L225 Difference]: With dead ends: 1278 [2025-03-16 18:43:37,815 INFO L226 Difference]: Without dead ends: 666 [2025-03-16 18:43:37,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-16 18:43:37,817 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 4 mSDsluCounter, 4915 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5737 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:37,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5737 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:43:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-16 18:43:37,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2025-03-16 18:43:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 503 states have (on average 1.4831013916500995) internal successors, (746), 514 states have internal predecessors, (746), 117 states have call successors, (117), 44 states have call predecessors, (117), 45 states have return successors, (118), 115 states have call predecessors, (118), 116 states have call successors, (118) [2025-03-16 18:43:37,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 981 transitions. [2025-03-16 18:43:37,853 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 981 transitions. Word has length 170 [2025-03-16 18:43:37,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:37,853 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 981 transitions. [2025-03-16 18:43:37,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 16.0) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 18:43:37,853 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 981 transitions. [2025-03-16 18:43:37,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-16 18:43:37,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:37,856 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:37,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 18:43:38,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:43:38,057 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:38,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:38,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1082453062, now seen corresponding path program 1 times [2025-03-16 18:43:38,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:38,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332300754] [2025-03-16 18:43:38,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:38,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:38,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-16 18:43:38,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-16 18:43:38,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:38,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:38,210 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-16 18:43:38,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:38,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332300754] [2025-03-16 18:43:38,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332300754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:43:38,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766642507] [2025-03-16 18:43:38,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:38,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:43:38,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:43:38,212 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:43:38,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 18:43:38,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-16 18:43:38,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-16 18:43:38,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:38,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:38,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 1367 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 18:43:38,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:43:38,539 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-16 18:43:38,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:43:38,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766642507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:38,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:43:38,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-16 18:43:38,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637805530] [2025-03-16 18:43:38,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:38,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:43:38,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:38,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:43:38,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 18:43:38,544 INFO L87 Difference]: Start difference. First operand 666 states and 981 transitions. Second operand has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-16 18:43:38,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:38,636 INFO L93 Difference]: Finished difference Result 1279 states and 1900 transitions. [2025-03-16 18:43:38,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:43:38,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 171 [2025-03-16 18:43:38,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:38,640 INFO L225 Difference]: With dead ends: 1279 [2025-03-16 18:43:38,640 INFO L226 Difference]: Without dead ends: 668 [2025-03-16 18:43:38,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 18:43:38,642 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 2 mSDsluCounter, 3271 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4093 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:38,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4093 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:43:38,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-03-16 18:43:38,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2025-03-16 18:43:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 504 states have (on average 1.4821428571428572) internal successors, (747), 516 states have internal predecessors, (747), 117 states have call successors, (117), 44 states have call predecessors, (117), 46 states have return successors, (123), 115 states have call predecessors, (123), 116 states have call successors, (123) [2025-03-16 18:43:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 987 transitions. [2025-03-16 18:43:38,668 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 987 transitions. Word has length 171 [2025-03-16 18:43:38,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:38,668 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 987 transitions. [2025-03-16 18:43:38,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-16 18:43:38,669 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 987 transitions. [2025-03-16 18:43:38,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-16 18:43:38,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:38,671 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:38,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 18:43:38,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:43:38,872 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:38,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:38,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2097537565, now seen corresponding path program 1 times [2025-03-16 18:43:38,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:38,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550637476] [2025-03-16 18:43:38,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:38,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:38,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-16 18:43:38,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-16 18:43:38,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:38,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-16 18:43:39,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:39,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550637476] [2025-03-16 18:43:39,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550637476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:39,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:43:39,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 18:43:39,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379197772] [2025-03-16 18:43:39,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:39,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:43:39,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:39,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:43:39,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:43:39,038 INFO L87 Difference]: Start difference. First operand 668 states and 987 transitions. Second operand has 8 states, 6 states have (on average 15.666666666666666) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 18:43:39,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:39,116 INFO L93 Difference]: Finished difference Result 1267 states and 1887 transitions. [2025-03-16 18:43:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:43:39,116 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 15.666666666666666) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 172 [2025-03-16 18:43:39,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:39,120 INFO L225 Difference]: With dead ends: 1267 [2025-03-16 18:43:39,120 INFO L226 Difference]: Without dead ends: 668 [2025-03-16 18:43:39,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:43:39,122 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 4 mSDsluCounter, 4921 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5744 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:39,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5744 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:43:39,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-03-16 18:43:39,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2025-03-16 18:43:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 504 states have (on average 1.4821428571428572) internal successors, (747), 516 states have internal predecessors, (747), 117 states have call successors, (117), 44 states have call predecessors, (117), 46 states have return successors, (122), 115 states have call predecessors, (122), 116 states have call successors, (122) [2025-03-16 18:43:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 986 transitions. [2025-03-16 18:43:39,145 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 986 transitions. Word has length 172 [2025-03-16 18:43:39,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:39,145 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 986 transitions. [2025-03-16 18:43:39,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 15.666666666666666) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 18:43:39,146 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 986 transitions. [2025-03-16 18:43:39,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-16 18:43:39,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:39,149 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:39,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 18:43:39,149 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:39,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:39,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1303599651, now seen corresponding path program 2 times [2025-03-16 18:43:39,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:39,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365871720] [2025-03-16 18:43:39,150 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:43:39,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:39,169 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 173 statements into 2 equivalence classes. [2025-03-16 18:43:39,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 62 of 173 statements. [2025-03-16 18:43:39,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 18:43:39,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-16 18:43:39,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:39,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365871720] [2025-03-16 18:43:39,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365871720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:39,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:43:39,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 18:43:39,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741455554] [2025-03-16 18:43:39,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:39,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:43:39,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:39,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:43:39,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:43:39,319 INFO L87 Difference]: Start difference. First operand 668 states and 986 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 18:43:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:39,815 INFO L93 Difference]: Finished difference Result 1309 states and 1951 transitions. [2025-03-16 18:43:39,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 18:43:39,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) Word has length 173 [2025-03-16 18:43:39,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:39,823 INFO L225 Difference]: With dead ends: 1309 [2025-03-16 18:43:39,823 INFO L226 Difference]: Without dead ends: 1305 [2025-03-16 18:43:39,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-16 18:43:39,824 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 1317 mSDsluCounter, 4017 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 4867 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:39,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1319 Valid, 4867 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 18:43:39,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2025-03-16 18:43:39,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1294. [2025-03-16 18:43:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 981 states have (on average 1.4943934760448523) internal successors, (1466), 1002 states have internal predecessors, (1466), 223 states have call successors, (223), 86 states have call predecessors, (223), 89 states have return successors, (238), 221 states have call predecessors, (238), 221 states have call successors, (238) [2025-03-16 18:43:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1927 transitions. [2025-03-16 18:43:39,885 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1927 transitions. Word has length 173 [2025-03-16 18:43:39,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:39,885 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1927 transitions. [2025-03-16 18:43:39,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 18:43:39,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1927 transitions. [2025-03-16 18:43:39,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-16 18:43:39,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:39,890 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:39,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 18:43:39,890 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:39,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:39,890 INFO L85 PathProgramCache]: Analyzing trace with hash 842988517, now seen corresponding path program 1 times [2025-03-16 18:43:39,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:39,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762724075] [2025-03-16 18:43:39,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:39,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:39,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-16 18:43:39,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-16 18:43:39,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:39,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:40,097 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-16 18:43:40,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:40,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762724075] [2025-03-16 18:43:40,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762724075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:40,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:43:40,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 18:43:40,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441057877] [2025-03-16 18:43:40,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:40,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:43:40,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:40,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:43:40,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:43:40,099 INFO L87 Difference]: Start difference. First operand 1294 states and 1927 transitions. Second operand has 8 states, 6 states have (on average 16.166666666666668) internal successors, (97), 8 states have internal predecessors, (97), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 18:43:40,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:40,202 INFO L93 Difference]: Finished difference Result 2502 states and 3750 transitions. [2025-03-16 18:43:40,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:43:40,202 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 16.166666666666668) internal successors, (97), 8 states have internal predecessors, (97), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 174 [2025-03-16 18:43:40,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:40,209 INFO L225 Difference]: With dead ends: 2502 [2025-03-16 18:43:40,209 INFO L226 Difference]: Without dead ends: 1298 [2025-03-16 18:43:40,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:43:40,213 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 3 mSDsluCounter, 4926 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5750 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:40,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5750 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:43:40,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2025-03-16 18:43:40,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1298. [2025-03-16 18:43:40,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 983 states have (on average 1.4933875890132249) internal successors, (1468), 1006 states have internal predecessors, (1468), 223 states have call successors, (223), 86 states have call predecessors, (223), 91 states have return successors, (241), 221 states have call predecessors, (241), 221 states have call successors, (241) [2025-03-16 18:43:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1932 transitions. [2025-03-16 18:43:40,262 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1932 transitions. Word has length 174 [2025-03-16 18:43:40,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:40,263 INFO L471 AbstractCegarLoop]: Abstraction has 1298 states and 1932 transitions. [2025-03-16 18:43:40,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 16.166666666666668) internal successors, (97), 8 states have internal predecessors, (97), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 18:43:40,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1932 transitions. [2025-03-16 18:43:40,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-16 18:43:40,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:40,266 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:40,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 18:43:40,267 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:40,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:40,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1742858360, now seen corresponding path program 1 times [2025-03-16 18:43:40,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:40,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593960763] [2025-03-16 18:43:40,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:40,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:40,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 18:43:40,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 18:43:40,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:40,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:40,408 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-16 18:43:40,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:40,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593960763] [2025-03-16 18:43:40,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593960763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:40,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:43:40,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 18:43:40,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058258149] [2025-03-16 18:43:40,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:40,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 18:43:40,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:40,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 18:43:40,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:43:40,410 INFO L87 Difference]: Start difference. First operand 1298 states and 1932 transitions. Second operand has 9 states, 7 states have (on average 14.428571428571429) internal successors, (101), 8 states have internal predecessors, (101), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 18:43:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:40,601 INFO L93 Difference]: Finished difference Result 2493 states and 3735 transitions. [2025-03-16 18:43:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:43:40,602 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 14.428571428571429) internal successors, (101), 8 states have internal predecessors, (101), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) Word has length 175 [2025-03-16 18:43:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:40,608 INFO L225 Difference]: With dead ends: 2493 [2025-03-16 18:43:40,608 INFO L226 Difference]: Without dead ends: 1298 [2025-03-16 18:43:40,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-16 18:43:40,612 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 7 mSDsluCounter, 5682 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6498 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:40,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6498 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:43:40,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2025-03-16 18:43:40,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1298. [2025-03-16 18:43:40,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 983 states have (on average 1.4933875890132249) internal successors, (1468), 1006 states have internal predecessors, (1468), 223 states have call successors, (223), 86 states have call predecessors, (223), 91 states have return successors, (239), 221 states have call predecessors, (239), 221 states have call successors, (239) [2025-03-16 18:43:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1930 transitions. [2025-03-16 18:43:40,677 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1930 transitions. Word has length 175 [2025-03-16 18:43:40,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:40,677 INFO L471 AbstractCegarLoop]: Abstraction has 1298 states and 1930 transitions. [2025-03-16 18:43:40,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 14.428571428571429) internal successors, (101), 8 states have internal predecessors, (101), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 18:43:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1930 transitions. [2025-03-16 18:43:40,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-16 18:43:40,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:40,681 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:40,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 18:43:40,682 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:40,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:40,682 INFO L85 PathProgramCache]: Analyzing trace with hash -741479419, now seen corresponding path program 2 times [2025-03-16 18:43:40,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:40,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281441508] [2025-03-16 18:43:40,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:43:40,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:40,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 176 statements into 2 equivalence classes. [2025-03-16 18:43:40,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 65 of 176 statements. [2025-03-16 18:43:40,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 18:43:40,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-16 18:43:40,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:40,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281441508] [2025-03-16 18:43:40,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281441508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:40,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:43:40,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 18:43:40,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934120544] [2025-03-16 18:43:40,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:40,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:43:40,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:40,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:43:40,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:43:40,789 INFO L87 Difference]: Start difference. First operand 1298 states and 1930 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 18:43:41,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:41,228 INFO L93 Difference]: Finished difference Result 2580 states and 3873 transitions. [2025-03-16 18:43:41,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 18:43:41,228 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) Word has length 176 [2025-03-16 18:43:41,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:41,242 INFO L225 Difference]: With dead ends: 2580 [2025-03-16 18:43:41,242 INFO L226 Difference]: Without dead ends: 2574 [2025-03-16 18:43:41,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-16 18:43:41,245 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 745 mSDsluCounter, 4875 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 5734 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:41,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 5734 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 18:43:41,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2025-03-16 18:43:41,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 2553. [2025-03-16 18:43:41,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2553 states, 1938 states have (on average 1.499484004127967) internal successors, (2906), 1985 states have internal predecessors, (2906), 432 states have call successors, (432), 169 states have call predecessors, (432), 182 states have return successors, (491), 430 states have call predecessors, (491), 428 states have call successors, (491) [2025-03-16 18:43:41,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3829 transitions. [2025-03-16 18:43:41,375 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3829 transitions. Word has length 176 [2025-03-16 18:43:41,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:41,376 INFO L471 AbstractCegarLoop]: Abstraction has 2553 states and 3829 transitions. [2025-03-16 18:43:41,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 18:43:41,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3829 transitions. [2025-03-16 18:43:41,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-16 18:43:41,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:41,384 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:41,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 18:43:41,385 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:41,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:41,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1570852058, now seen corresponding path program 1 times [2025-03-16 18:43:41,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:41,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641784402] [2025-03-16 18:43:41,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:41,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:41,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-16 18:43:41,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-16 18:43:41,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:41,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-16 18:43:41,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:41,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641784402] [2025-03-16 18:43:41,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641784402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:43:41,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113358019] [2025-03-16 18:43:41,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:41,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:43:41,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:43:41,525 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:43:41,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 18:43:41,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-16 18:43:41,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-16 18:43:41,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:41,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:41,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 1372 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 18:43:41,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:43:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-16 18:43:41,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:43:41,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113358019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:41,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:43:41,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-16 18:43:41,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656380735] [2025-03-16 18:43:41,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:41,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:43:41,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:41,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:43:41,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:43:41,837 INFO L87 Difference]: Start difference. First operand 2553 states and 3829 transitions. Second operand has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-16 18:43:41,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:41,941 INFO L93 Difference]: Finished difference Result 3820 states and 5728 transitions. [2025-03-16 18:43:41,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:43:41,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 176 [2025-03-16 18:43:41,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:41,955 INFO L225 Difference]: With dead ends: 3820 [2025-03-16 18:43:41,955 INFO L226 Difference]: Without dead ends: 2552 [2025-03-16 18:43:41,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:43:41,960 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 1 mSDsluCounter, 3282 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4107 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:41,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4107 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:43:41,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2025-03-16 18:43:42,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2544. [2025-03-16 18:43:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 1933 states have (on average 1.5002586652871184) internal successors, (2900), 1980 states have internal predecessors, (2900), 429 states have call successors, (429), 168 states have call predecessors, (429), 181 states have return successors, (488), 427 states have call predecessors, (488), 425 states have call successors, (488) [2025-03-16 18:43:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 3817 transitions. [2025-03-16 18:43:42,088 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 3817 transitions. Word has length 176 [2025-03-16 18:43:42,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:42,088 INFO L471 AbstractCegarLoop]: Abstraction has 2544 states and 3817 transitions. [2025-03-16 18:43:42,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-16 18:43:42,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 3817 transitions. [2025-03-16 18:43:42,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-16 18:43:42,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:42,095 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:42,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 18:43:42,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 18:43:42,296 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:42,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:42,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1329261095, now seen corresponding path program 1 times [2025-03-16 18:43:42,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:42,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724335098] [2025-03-16 18:43:42,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:42,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:42,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-16 18:43:42,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-16 18:43:42,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:42,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-16 18:43:42,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:42,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724335098] [2025-03-16 18:43:42,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724335098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:42,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:43:42,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 18:43:42,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831017657] [2025-03-16 18:43:42,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:42,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 18:43:42,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:42,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 18:43:42,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:43:42,452 INFO L87 Difference]: Start difference. First operand 2544 states and 3817 transitions. Second operand has 9 states, 7 states have (on average 16.142857142857142) internal successors, (113), 8 states have internal predecessors, (113), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2025-03-16 18:43:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:42,620 INFO L93 Difference]: Finished difference Result 4956 states and 7468 transitions. [2025-03-16 18:43:42,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:43:42,621 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 16.142857142857142) internal successors, (113), 8 states have internal predecessors, (113), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 191 [2025-03-16 18:43:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:42,637 INFO L225 Difference]: With dead ends: 4956 [2025-03-16 18:43:42,637 INFO L226 Difference]: Without dead ends: 2548 [2025-03-16 18:43:42,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-16 18:43:42,670 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 4 mSDsluCounter, 5696 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6514 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:42,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6514 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:43:42,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2025-03-16 18:43:42,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2544. [2025-03-16 18:43:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 1933 states have (on average 1.5002586652871184) internal successors, (2900), 1980 states have internal predecessors, (2900), 429 states have call successors, (429), 168 states have call predecessors, (429), 181 states have return successors, (484), 427 states have call predecessors, (484), 425 states have call successors, (484) [2025-03-16 18:43:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 3813 transitions. [2025-03-16 18:43:42,760 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 3813 transitions. Word has length 191 [2025-03-16 18:43:42,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:42,760 INFO L471 AbstractCegarLoop]: Abstraction has 2544 states and 3813 transitions. [2025-03-16 18:43:42,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 16.142857142857142) internal successors, (113), 8 states have internal predecessors, (113), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2025-03-16 18:43:42,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 3813 transitions. [2025-03-16 18:43:42,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-16 18:43:42,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:42,771 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:42,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 18:43:42,771 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:42,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:42,772 INFO L85 PathProgramCache]: Analyzing trace with hash 178165882, now seen corresponding path program 1 times [2025-03-16 18:43:42,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:42,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492666807] [2025-03-16 18:43:42,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:42,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:42,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-16 18:43:42,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-16 18:43:42,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:42,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-16 18:43:42,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:42,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492666807] [2025-03-16 18:43:42,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492666807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:43:42,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618064444] [2025-03-16 18:43:42,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:42,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:43:42,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:43:42,859 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:43:42,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 18:43:43,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-16 18:43:43,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-16 18:43:43,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:43,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:43,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 1374 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 18:43:43,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:43:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-16 18:43:43,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:43:43,245 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-16 18:43:43,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618064444] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:43:43,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:43:43,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-16 18:43:43,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018926212] [2025-03-16 18:43:43,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:43:43,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:43:43,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:43,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:43:43,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:43:43,246 INFO L87 Difference]: Start difference. First operand 2544 states and 3813 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-16 18:43:43,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:43,476 INFO L93 Difference]: Finished difference Result 5978 states and 9236 transitions. [2025-03-16 18:43:43,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:43:43,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 178 [2025-03-16 18:43:43,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:43,500 INFO L225 Difference]: With dead ends: 5978 [2025-03-16 18:43:43,500 INFO L226 Difference]: Without dead ends: 4700 [2025-03-16 18:43:43,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:43:43,507 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 617 mSDsluCounter, 1999 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 2894 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:43,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 2894 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:43:43,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4700 states. [2025-03-16 18:43:43,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4700 to 4604. [2025-03-16 18:43:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4604 states, 3677 states have (on average 1.5501767745444657) internal successors, (5700), 3724 states have internal predecessors, (5700), 745 states have call successors, (745), 168 states have call predecessors, (745), 181 states have return successors, (880), 743 states have call predecessors, (880), 741 states have call successors, (880) [2025-03-16 18:43:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4604 states to 4604 states and 7325 transitions. [2025-03-16 18:43:43,731 INFO L78 Accepts]: Start accepts. Automaton has 4604 states and 7325 transitions. Word has length 178 [2025-03-16 18:43:43,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:43,731 INFO L471 AbstractCegarLoop]: Abstraction has 4604 states and 7325 transitions. [2025-03-16 18:43:43,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-16 18:43:43,732 INFO L276 IsEmpty]: Start isEmpty. Operand 4604 states and 7325 transitions. [2025-03-16 18:43:43,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-16 18:43:43,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:43,746 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:43,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 18:43:43,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 18:43:43,950 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:43,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:43,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1964385234, now seen corresponding path program 1 times [2025-03-16 18:43:43,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:43,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667836041] [2025-03-16 18:43:43,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:43,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:43,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-16 18:43:43,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-16 18:43:43,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:43,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-16 18:43:44,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:44,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667836041] [2025-03-16 18:43:44,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667836041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:44,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:43:44,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 18:43:44,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758674014] [2025-03-16 18:43:44,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:44,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:43:44,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:44,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:43:44,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:43:44,006 INFO L87 Difference]: Start difference. First operand 4604 states and 7325 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 18:43:44,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:44,154 INFO L93 Difference]: Finished difference Result 10834 states and 17468 transitions. [2025-03-16 18:43:44,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:43:44,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 183 [2025-03-16 18:43:44,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:44,182 INFO L225 Difference]: With dead ends: 10834 [2025-03-16 18:43:44,182 INFO L226 Difference]: Without dead ends: 6560 [2025-03-16 18:43:44,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:43:44,192 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 160 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:44,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1667 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:43:44,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6560 states. [2025-03-16 18:43:44,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6560 to 6528. [2025-03-16 18:43:44,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6528 states, 5285 states have (on average 1.5598864711447493) internal successors, (8244), 5332 states have internal predecessors, (8244), 1061 states have call successors, (1061), 168 states have call predecessors, (1061), 181 states have return successors, (1276), 1059 states have call predecessors, (1276), 1057 states have call successors, (1276) [2025-03-16 18:43:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6528 states to 6528 states and 10581 transitions. [2025-03-16 18:43:44,384 INFO L78 Accepts]: Start accepts. Automaton has 6528 states and 10581 transitions. Word has length 183 [2025-03-16 18:43:44,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:44,384 INFO L471 AbstractCegarLoop]: Abstraction has 6528 states and 10581 transitions. [2025-03-16 18:43:44,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 18:43:44,384 INFO L276 IsEmpty]: Start isEmpty. Operand 6528 states and 10581 transitions. [2025-03-16 18:43:44,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-16 18:43:44,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:44,406 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:44,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 18:43:44,407 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:44,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:44,407 INFO L85 PathProgramCache]: Analyzing trace with hash 900953318, now seen corresponding path program 1 times [2025-03-16 18:43:44,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:44,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700458546] [2025-03-16 18:43:44,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:44,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:44,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-16 18:43:44,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-16 18:43:44,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:44,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-16 18:43:44,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:44,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700458546] [2025-03-16 18:43:44,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700458546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:44,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:43:44,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 18:43:44,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948331888] [2025-03-16 18:43:44,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:44,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:43:44,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:44,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:43:44,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:43:44,466 INFO L87 Difference]: Start difference. First operand 6528 states and 10581 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, (31), 2 states have call predecessors, (31), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-16 18:43:44,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:44,656 INFO L93 Difference]: Finished difference Result 15610 states and 25524 transitions. [2025-03-16 18:43:44,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:43:44,657 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, (31), 2 states have call predecessors, (31), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 205 [2025-03-16 18:43:44,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:44,694 INFO L225 Difference]: With dead ends: 15610 [2025-03-16 18:43:44,694 INFO L226 Difference]: Without dead ends: 9644 [2025-03-16 18:43:44,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:43:44,713 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 158 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:44,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1656 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:43:44,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9644 states. [2025-03-16 18:43:45,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9644 to 9612. [2025-03-16 18:43:45,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9612 states, 7893 states have (on average 1.5725326238439123) internal successors, (12412), 7940 states have internal predecessors, (12412), 1537 states have call successors, (1537), 168 states have call predecessors, (1537), 181 states have return successors, (1816), 1535 states have call predecessors, (1816), 1533 states have call successors, (1816) [2025-03-16 18:43:45,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9612 states to 9612 states and 15765 transitions. [2025-03-16 18:43:45,050 INFO L78 Accepts]: Start accepts. Automaton has 9612 states and 15765 transitions. Word has length 205 [2025-03-16 18:43:45,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:45,051 INFO L471 AbstractCegarLoop]: Abstraction has 9612 states and 15765 transitions. [2025-03-16 18:43:45,051 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, (31), 2 states have call predecessors, (31), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-16 18:43:45,051 INFO L276 IsEmpty]: Start isEmpty. Operand 9612 states and 15765 transitions. [2025-03-16 18:43:45,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-16 18:43:45,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:45,086 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:45,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 18:43:45,086 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:45,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:45,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1802004175, now seen corresponding path program 1 times [2025-03-16 18:43:45,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:45,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550597819] [2025-03-16 18:43:45,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:45,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:45,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 18:43:45,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 18:43:45,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:45,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-16 18:43:45,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:45,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550597819] [2025-03-16 18:43:45,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550597819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:45,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:43:45,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 18:43:45,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930004263] [2025-03-16 18:43:45,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:45,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:43:45,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:45,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:43:45,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:43:45,140 INFO L87 Difference]: Start difference. First operand 9612 states and 15765 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, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 18:43:45,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:45,450 INFO L93 Difference]: Finished difference Result 22850 states and 37828 transitions. [2025-03-16 18:43:45,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:43:45,450 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, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 185 [2025-03-16 18:43:45,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:45,500 INFO L225 Difference]: With dead ends: 22850 [2025-03-16 18:43:45,500 INFO L226 Difference]: Without dead ends: 14384 [2025-03-16 18:43:45,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:43:45,522 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 156 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:45,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1653 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:43:45,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14384 states. [2025-03-16 18:43:46,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14384 to 14352. [2025-03-16 18:43:46,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14352 states, 11985 states have (on average 1.5836462244472258) internal successors, (18980), 12032 states have internal predecessors, (18980), 2185 states have call successors, (2185), 168 states have call predecessors, (2185), 181 states have return successors, (2632), 2183 states have call predecessors, (2632), 2181 states have call successors, (2632) [2025-03-16 18:43:46,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14352 states to 14352 states and 23797 transitions. [2025-03-16 18:43:46,120 INFO L78 Accepts]: Start accepts. Automaton has 14352 states and 23797 transitions. Word has length 185 [2025-03-16 18:43:46,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:46,121 INFO L471 AbstractCegarLoop]: Abstraction has 14352 states and 23797 transitions. [2025-03-16 18:43:46,121 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, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 18:43:46,121 INFO L276 IsEmpty]: Start isEmpty. Operand 14352 states and 23797 transitions. [2025-03-16 18:43:46,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-16 18:43:46,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:46,150 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:46,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 18:43:46,151 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:46,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:46,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1594821676, now seen corresponding path program 1 times [2025-03-16 18:43:46,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:46,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749127076] [2025-03-16 18:43:46,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:46,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:46,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-16 18:43:46,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-16 18:43:46,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:46,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-16 18:43:46,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:46,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749127076] [2025-03-16 18:43:46,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749127076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:46,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:43:46,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 18:43:46,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503071058] [2025-03-16 18:43:46,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:46,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:43:46,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:46,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:43:46,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:43:46,208 INFO L87 Difference]: Start difference. First operand 14352 states and 23797 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, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-16 18:43:46,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:46,573 INFO L93 Difference]: Finished difference Result 34266 states and 57324 transitions. [2025-03-16 18:43:46,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:43:46,573 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, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 200 [2025-03-16 18:43:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:46,645 INFO L225 Difference]: With dead ends: 34266 [2025-03-16 18:43:46,645 INFO L226 Difference]: Without dead ends: 22028 [2025-03-16 18:43:46,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:43:46,680 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 154 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:46,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1653 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:43:46,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22028 states. [2025-03-16 18:43:47,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22028 to 21996. [2025-03-16 18:43:47,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21996 states, 18649 states have (on average 1.5932221566840046) internal successors, (29712), 18696 states have internal predecessors, (29712), 3165 states have call successors, (3165), 168 states have call predecessors, (3165), 181 states have return successors, (3892), 3163 states have call predecessors, (3892), 3161 states have call successors, (3892) [2025-03-16 18:43:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21996 states to 21996 states and 36769 transitions. [2025-03-16 18:43:47,369 INFO L78 Accepts]: Start accepts. Automaton has 21996 states and 36769 transitions. Word has length 200 [2025-03-16 18:43:47,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:47,369 INFO L471 AbstractCegarLoop]: Abstraction has 21996 states and 36769 transitions. [2025-03-16 18:43:47,370 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, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-16 18:43:47,370 INFO L276 IsEmpty]: Start isEmpty. Operand 21996 states and 36769 transitions. [2025-03-16 18:43:47,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-16 18:43:47,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:47,406 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:47,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 18:43:47,406 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:47,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:47,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1056961360, now seen corresponding path program 1 times [2025-03-16 18:43:47,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:47,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132750303] [2025-03-16 18:43:47,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:47,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:47,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-16 18:43:47,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-16 18:43:47,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:47,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-16 18:43:47,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:47,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132750303] [2025-03-16 18:43:47,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132750303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:47,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:43:47,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 18:43:47,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408297829] [2025-03-16 18:43:47,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:47,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:43:47,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:47,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:43:47,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:43:47,514 INFO L87 Difference]: Start difference. First operand 21996 states and 36769 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 18:43:48,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:48,215 INFO L93 Difference]: Finished difference Result 53434 states and 89800 transitions. [2025-03-16 18:43:48,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:43:48,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 187 [2025-03-16 18:43:48,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:48,350 INFO L225 Difference]: With dead ends: 53434 [2025-03-16 18:43:48,351 INFO L226 Difference]: Without dead ends: 34976 [2025-03-16 18:43:48,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:43:48,396 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 152 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:48,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1659 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:43:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34976 states. [2025-03-16 18:43:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34976 to 34944. [2025-03-16 18:43:49,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34944 states, 29625 states have (on average 1.5883881856540085) internal successors, (47056), 29672 states have internal predecessors, (47056), 5137 states have call successors, (5137), 168 states have call predecessors, (5137), 181 states have return successors, (6352), 5135 states have call predecessors, (6352), 5133 states have call successors, (6352) [2025-03-16 18:43:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34944 states to 34944 states and 58545 transitions. [2025-03-16 18:43:49,845 INFO L78 Accepts]: Start accepts. Automaton has 34944 states and 58545 transitions. Word has length 187 [2025-03-16 18:43:49,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:49,845 INFO L471 AbstractCegarLoop]: Abstraction has 34944 states and 58545 transitions. [2025-03-16 18:43:49,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 18:43:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 34944 states and 58545 transitions. [2025-03-16 18:43:49,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-16 18:43:49,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:49,897 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:49,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 18:43:49,898 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:49,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:49,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1347027091, now seen corresponding path program 1 times [2025-03-16 18:43:49,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:49,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181355769] [2025-03-16 18:43:49,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:49,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:49,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-16 18:43:49,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-16 18:43:49,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:49,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-16 18:43:49,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:49,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181355769] [2025-03-16 18:43:49,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181355769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:49,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:43:49,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 18:43:49,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421724106] [2025-03-16 18:43:49,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:49,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:43:49,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:49,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:43:49,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:43:49,957 INFO L87 Difference]: Start difference. First operand 34944 states and 58545 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-16 18:43:50,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:50,987 INFO L93 Difference]: Finished difference Result 87690 states and 147816 transitions. [2025-03-16 18:43:50,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:43:50,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 202 [2025-03-16 18:43:50,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:51,196 INFO L225 Difference]: With dead ends: 87690 [2025-03-16 18:43:51,196 INFO L226 Difference]: Without dead ends: 58140 [2025-03-16 18:43:51,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:43:51,258 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 150 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:51,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1660 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:43:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58140 states. [2025-03-16 18:43:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58140 to 58108. [2025-03-16 18:43:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58108 states, 49501 states have (on average 1.5945536453809015) internal successors, (78932), 49548 states have internal predecessors, (78932), 8425 states have call successors, (8425), 168 states have call predecessors, (8425), 181 states have return successors, (10240), 8423 states have call predecessors, (10240), 8421 states have call successors, (10240) [2025-03-16 18:43:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58108 states to 58108 states and 97597 transitions. [2025-03-16 18:43:53,103 INFO L78 Accepts]: Start accepts. Automaton has 58108 states and 97597 transitions. Word has length 202 [2025-03-16 18:43:53,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:53,103 INFO L471 AbstractCegarLoop]: Abstraction has 58108 states and 97597 transitions. [2025-03-16 18:43:53,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-16 18:43:53,104 INFO L276 IsEmpty]: Start isEmpty. Operand 58108 states and 97597 transitions. [2025-03-16 18:43:53,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-16 18:43:53,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:53,347 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:53,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 18:43:53,347 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:53,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:53,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1415944157, now seen corresponding path program 1 times [2025-03-16 18:43:53,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:53,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489816533] [2025-03-16 18:43:53,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:53,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:53,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-16 18:43:53,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-16 18:43:53,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:53,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:53,400 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-16 18:43:53,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:53,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489816533] [2025-03-16 18:43:53,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489816533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:53,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:43:53,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 18:43:53,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287009773] [2025-03-16 18:43:53,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:53,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:43:53,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:53,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:43:53,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:43:53,402 INFO L87 Difference]: Start difference. First operand 58108 states and 97597 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-16 18:43:55,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:43:55,430 INFO L93 Difference]: Finished difference Result 139906 states and 234332 transitions. [2025-03-16 18:43:55,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:43:55,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 210 [2025-03-16 18:43:55,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:43:55,825 INFO L225 Difference]: With dead ends: 139906 [2025-03-16 18:43:55,826 INFO L226 Difference]: Without dead ends: 91540 [2025-03-16 18:43:55,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:43:55,941 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 148 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:43:55,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1654 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:43:56,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91540 states. [2025-03-16 18:43:58,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91540 to 91508. [2025-03-16 18:43:58,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91508 states, 78089 states have (on average 1.5690814327241993) internal successors, (122528), 78136 states have internal predecessors, (122528), 13237 states have call successors, (13237), 168 states have call predecessors, (13237), 181 states have return successors, (16464), 13235 states have call predecessors, (16464), 13233 states have call successors, (16464) [2025-03-16 18:43:59,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91508 states to 91508 states and 152229 transitions. [2025-03-16 18:43:59,176 INFO L78 Accepts]: Start accepts. Automaton has 91508 states and 152229 transitions. Word has length 210 [2025-03-16 18:43:59,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:43:59,176 INFO L471 AbstractCegarLoop]: Abstraction has 91508 states and 152229 transitions. [2025-03-16 18:43:59,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-16 18:43:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 91508 states and 152229 transitions. [2025-03-16 18:43:59,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-16 18:43:59,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:43:59,293 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:43:59,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 18:43:59,293 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:43:59,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:43:59,293 INFO L85 PathProgramCache]: Analyzing trace with hash -34669966, now seen corresponding path program 1 times [2025-03-16 18:43:59,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:43:59,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451427170] [2025-03-16 18:43:59,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:43:59,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:43:59,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-16 18:43:59,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-16 18:43:59,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:43:59,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:43:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-16 18:43:59,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:43:59,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451427170] [2025-03-16 18:43:59,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451427170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:43:59,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:43:59,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 18:43:59,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805542686] [2025-03-16 18:43:59,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:43:59,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:43:59,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:43:59,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:43:59,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:43:59,346 INFO L87 Difference]: Start difference. First operand 91508 states and 152229 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, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-16 18:44:03,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:44:03,188 INFO L93 Difference]: Finished difference Result 241554 states and 403580 transitions. [2025-03-16 18:44:03,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:44:03,189 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, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 204 [2025-03-16 18:44:03,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:44:03,818 INFO L225 Difference]: With dead ends: 241554 [2025-03-16 18:44:03,818 INFO L226 Difference]: Without dead ends: 162804 [2025-03-16 18:44:03,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:44:03,983 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 146 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:44:03,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1657 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:44:04,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162804 states. [2025-03-16 18:44:09,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162804 to 162772. [2025-03-16 18:44:09,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162772 states, 139553 states have (on average 1.5693535789270026) internal successors, (219008), 139600 states have internal predecessors, (219008), 23037 states have call successors, (23037), 168 states have call predecessors, (23037), 181 states have return successors, (28972), 23035 states have call predecessors, (28972), 23033 states have call successors, (28972) [2025-03-16 18:44:10,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162772 states to 162772 states and 271017 transitions. [2025-03-16 18:44:10,447 INFO L78 Accepts]: Start accepts. Automaton has 162772 states and 271017 transitions. Word has length 204 [2025-03-16 18:44:10,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:44:10,448 INFO L471 AbstractCegarLoop]: Abstraction has 162772 states and 271017 transitions. [2025-03-16 18:44:10,448 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, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-16 18:44:10,448 INFO L276 IsEmpty]: Start isEmpty. Operand 162772 states and 271017 transitions. [2025-03-16 18:44:10,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-16 18:44:10,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:44:10,607 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:44:10,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 18:44:10,607 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:44:10,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:44:10,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1633649870, now seen corresponding path program 1 times [2025-03-16 18:44:10,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:44:10,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673854890] [2025-03-16 18:44:10,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:44:10,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:44:10,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-16 18:44:10,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-16 18:44:10,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:44:10,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:44:10,708 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-16 18:44:10,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:44:10,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673854890] [2025-03-16 18:44:10,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673854890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:44:10,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:44:10,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 18:44:10,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287358216] [2025-03-16 18:44:10,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:44:10,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:44:10,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:44:10,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:44:10,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 18:44:10,710 INFO L87 Difference]: Start difference. First operand 162772 states and 271017 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, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)