./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec9_productSimulator.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec9_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 a46e94d21677d8e787ff51041171bb0d6a97c638f1cb1f2181c1b14c15718344 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:38:12,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:38:12,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:38:12,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:38:12,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:38:12,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:38:12,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:38:12,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:38:12,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:38:12,261 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:38:12,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:38:12,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:38:12,261 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:38:12,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:38:12,261 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:38:12,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:38:12,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:38:12,262 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:38:12,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:38:12,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:38:12,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:38:12,262 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:38:12,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:38:12,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:38:12,263 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:38:12,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:38:12,263 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:38:12,263 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:38:12,263 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:38:12,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:38:12,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:38:12,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:38:12,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:38:12,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:38:12,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:38:12,264 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:38:12,264 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:38:12,264 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:38:12,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:38:12,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:38:12,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:38:12,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:38:12,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:38:12,264 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 -> a46e94d21677d8e787ff51041171bb0d6a97c638f1cb1f2181c1b14c15718344 [2025-03-08 05:38:12,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:38:12,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:38:12,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:38:12,570 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:38:12,570 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:38:12,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec9_productSimulator.cil.c [2025-03-08 05:38:13,797 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95397d860/2a8e161da94f4a4298c2376110de2432/FLAG1d0258728 [2025-03-08 05:38:14,161 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:38:14,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_productSimulator.cil.c [2025-03-08 05:38:14,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95397d860/2a8e161da94f4a4298c2376110de2432/FLAG1d0258728 [2025-03-08 05:38:14,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95397d860/2a8e161da94f4a4298c2376110de2432 [2025-03-08 05:38:14,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:38:14,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:38:14,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:38:14,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:38:14,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:38:14,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:38:14" (1/1) ... [2025-03-08 05:38:14,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd49db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:14, skipping insertion in model container [2025-03-08 05:38:14,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:38:14" (1/1) ... [2025-03-08 05:38:14,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:38:14,613 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_spec9_productSimulator.cil.c[31629,31642] [2025-03-08 05:38:14,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:38:14,770 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:38:14,776 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-03-08 05:38:14,777 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [335] [2025-03-08 05:38:14,777 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [747] [2025-03-08 05:38:14,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1323] [2025-03-08 05:38:14,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1686] [2025-03-08 05:38:14,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1695] [2025-03-08 05:38:14,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [2061] [2025-03-08 05:38:14,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2103] [2025-03-08 05:38:14,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2210] [2025-03-08 05:38:14,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2414] [2025-03-08 05:38:14,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [2431] [2025-03-08 05:38:14,824 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_spec9_productSimulator.cil.c[31629,31642] [2025-03-08 05:38:14,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:38:14,900 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:38:14,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:14 WrapperNode [2025-03-08 05:38:14,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:38:14,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:38:14,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:38:14,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:38:14,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:14" (1/1) ... [2025-03-08 05:38:14,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:14" (1/1) ... [2025-03-08 05:38:14,966 INFO L138 Inliner]: procedures = 152, calls = 266, calls flagged for inlining = 68, calls inlined = 65, statements flattened = 1328 [2025-03-08 05:38:14,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:38:14,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:38:14,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:38:14,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:38:14,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:14" (1/1) ... [2025-03-08 05:38:14,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:14" (1/1) ... [2025-03-08 05:38:14,982 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:14" (1/1) ... [2025-03-08 05:38:15,014 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-08 05:38:15,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:14" (1/1) ... [2025-03-08 05:38:15,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:14" (1/1) ... [2025-03-08 05:38:15,028 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:14" (1/1) ... [2025-03-08 05:38:15,030 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:14" (1/1) ... [2025-03-08 05:38:15,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:14" (1/1) ... [2025-03-08 05:38:15,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:14" (1/1) ... [2025-03-08 05:38:15,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:38:15,056 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:38:15,056 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:38:15,056 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:38:15,057 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:14" (1/1) ... [2025-03-08 05:38:15,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:38:15,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:38:15,086 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:38:15,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:38:15,108 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-08 05:38:15,108 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-08 05:38:15,108 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-03-08 05:38:15,108 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-03-08 05:38:15,108 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-03-08 05:38:15,108 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-03-08 05:38:15,108 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-08 05:38:15,109 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-08 05:38:15,109 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:38:15,109 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:38:15,109 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-08 05:38:15,109 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-08 05:38:15,109 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:38:15,109 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:38:15,109 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-03-08 05:38:15,109 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-03-08 05:38:15,110 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:38:15,110 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:38:15,110 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-03-08 05:38:15,110 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-03-08 05:38:15,110 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:38:15,111 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:38:15,111 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:38:15,111 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:38:15,111 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:38:15,111 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:38:15,111 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-03-08 05:38:15,111 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-03-08 05:38:15,111 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-03-08 05:38:15,111 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-03-08 05:38:15,111 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:38:15,112 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:38:15,112 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:38:15,112 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:38:15,112 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:38:15,112 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:38:15,112 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-03-08 05:38:15,112 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-03-08 05:38:15,112 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:38:15,112 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:38:15,113 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-08 05:38:15,113 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-08 05:38:15,113 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:38:15,113 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:38:15,113 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-03-08 05:38:15,113 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-03-08 05:38:15,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:38:15,113 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:38:15,113 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:38:15,113 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-08 05:38:15,113 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-08 05:38:15,113 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-03-08 05:38:15,114 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-03-08 05:38:15,114 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-03-08 05:38:15,114 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-03-08 05:38:15,114 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-03-08 05:38:15,114 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-03-08 05:38:15,114 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-08 05:38:15,114 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-08 05:38:15,114 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:38:15,114 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:38:15,114 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:38:15,115 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:38:15,115 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:38:15,115 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:38:15,115 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-08 05:38:15,115 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-08 05:38:15,115 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:38:15,115 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:38:15,115 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:38:15,115 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:38:15,115 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-03-08 05:38:15,115 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-03-08 05:38:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-03-08 05:38:15,116 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-03-08 05:38:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:38:15,116 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:38:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:38:15,116 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:38:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:38:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:38:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:38:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:38:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:38:15,116 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:38:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-03-08 05:38:15,117 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-03-08 05:38:15,117 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-03-08 05:38:15,117 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-03-08 05:38:15,117 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-08 05:38:15,117 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-08 05:38:15,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:38:15,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:38:15,302 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:38:15,305 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:38:15,336 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2349: #res := ~retValue_acc~22; [2025-03-08 05:38:15,350 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L654: #res := ~retValue_acc~8; [2025-03-08 05:38:15,366 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1207: #res := ~retValue_acc~15; [2025-03-08 05:38:15,381 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: #res := ~retValue_acc~37; [2025-03-08 05:38:15,465 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2577: #res := ~retValue_acc~31; [2025-03-08 05:38:15,514 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L391-1: getEmailId_#res#1 := getEmailId_~retValue_acc~1#1; [2025-03-08 05:38:15,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L617: #res := ~retValue_acc~7; [2025-03-08 05:38:15,581 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L465: #res := ~retValue_acc~3; [2025-03-08 05:38:15,646 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2369-1: isReadable__role__Encrypt_#res#1 := isReadable__role__Encrypt_~retValue_acc~23#1; [2025-03-08 05:38:15,646 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2387: #res#1 := ~retValue_acc~24#1; [2025-03-08 05:38:15,724 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3125: #res#1 := ~retValue_acc~39#1; [2025-03-08 05:38:15,725 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~38#1; [2025-03-08 05:38:15,769 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3349: #res := ~retValue_acc~42; [2025-03-08 05:38:15,779 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2411-1: createEmail_#res#1 := createEmail_~retValue_acc~26#1; [2025-03-08 05:38:15,784 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L580: #res := ~retValue_acc~6; [2025-03-08 05:38:15,840 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3468-1: getClientId_#res#1 := getClientId_~retValue_acc~44#1; [2025-03-08 05:38:15,879 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3421-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~43#1; [2025-03-08 05:38:15,879 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L728-1: isVerified_#res#1 := isVerified_~retValue_acc~10#1; [2025-03-08 05:38:15,884 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: #res := ~retValue_acc~9; [2025-03-08 05:38:15,905 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2112: #res := ~retValue_acc~20; [2025-03-08 05:38:15,944 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2903: #res := ~retValue_acc~35; [2025-03-08 05:38:15,961 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2986-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~36#1; [2025-03-08 05:38:16,216 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1164-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~12#1; [2025-03-08 05:38:16,217 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3295-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~41#1; [2025-03-08 05:38:16,217 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1182-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~14#1; [2025-03-08 05:38:16,217 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2207-1: valid_product_#res#1 := valid_product_~retValue_acc~21#1; [2025-03-08 05:38:16,217 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1173-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~13#1; [2025-03-08 05:38:16,217 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3188-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~40#1; [2025-03-08 05:38:16,222 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L428: #res := ~retValue_acc~2; [2025-03-08 05:38:16,393 INFO L? ?]: Removed 629 outVars from TransFormulas that were not future-live. [2025-03-08 05:38:16,393 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:38:16,414 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:38:16,414 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:38:16,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:38:16 BoogieIcfgContainer [2025-03-08 05:38:16,414 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:38:16,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:38:16,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:38:16,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:38:16,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:38:14" (1/3) ... [2025-03-08 05:38:16,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541ade6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:38:16, skipping insertion in model container [2025-03-08 05:38:16,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:14" (2/3) ... [2025-03-08 05:38:16,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541ade6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:38:16, skipping insertion in model container [2025-03-08 05:38:16,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:38:16" (3/3) ... [2025-03-08 05:38:16,424 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec9_productSimulator.cil.c [2025-03-08 05:38:16,439 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:38:16,441 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec9_productSimulator.cil.c that has 44 procedures, 602 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:38:16,507 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:38:16,515 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;@4a001372, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:38:16,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:38:16,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 602 states, 447 states have (on average 1.5145413870246085) internal successors, (677), 467 states have internal predecessors, (677), 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-08 05:38:16,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 05:38:16,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:16,539 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] [2025-03-08 05:38:16,540 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:16,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:16,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1175038961, now seen corresponding path program 1 times [2025-03-08 05:38:16,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:16,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049965109] [2025-03-08 05:38:16,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:16,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:16,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:38:16,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:38:16,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:16,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:17,094 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-08 05:38:17,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:17,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049965109] [2025-03-08 05:38:17,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049965109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:17,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:17,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:38:17,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286201767] [2025-03-08 05:38:17,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:17,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:38:17,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:17,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:38:17,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:38:17,125 INFO L87 Difference]: Start difference. First operand has 602 states, 447 states have (on average 1.5145413870246085) internal successors, (677), 467 states have internal predecessors, (677), 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:38:17,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:17,253 INFO L93 Difference]: Finished difference Result 1167 states and 1748 transitions. [2025-03-08 05:38:17,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:38:17,256 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 127 [2025-03-08 05:38:17,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:17,271 INFO L225 Difference]: With dead ends: 1167 [2025-03-08 05:38:17,271 INFO L226 Difference]: Without dead ends: 595 [2025-03-08 05:38:17,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:38:17,280 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 0 mSDsluCounter, 2660 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3551 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-08 05:38:17,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3551 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:17,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-08 05:38:17,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2025-03-08 05:38:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 441 states have (on average 1.4965986394557824) internal successors, (660), 460 states have internal predecessors, (660), 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-08 05:38:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 879 transitions. [2025-03-08 05:38:17,383 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 879 transitions. Word has length 127 [2025-03-08 05:38:17,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:17,384 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 879 transitions. [2025-03-08 05:38:17,384 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:38:17,385 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 879 transitions. [2025-03-08 05:38:17,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 05:38:17,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:17,393 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] [2025-03-08 05:38:17,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:38:17,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:17,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:17,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1530599374, now seen corresponding path program 1 times [2025-03-08 05:38:17,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:17,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673784112] [2025-03-08 05:38:17,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:17,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:17,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:38:17,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:38:17,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:17,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:17,609 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-08 05:38:17,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:17,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673784112] [2025-03-08 05:38:17,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673784112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:17,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:17,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:38:17,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750142351] [2025-03-08 05:38:17,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:17,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:17,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:17,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:17,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:17,614 INFO L87 Difference]: Start difference. First operand 595 states and 879 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:38:17,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:17,686 INFO L93 Difference]: Finished difference Result 1164 states and 1740 transitions. [2025-03-08 05:38:17,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:17,687 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 132 [2025-03-08 05:38:17,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:17,692 INFO L225 Difference]: With dead ends: 1164 [2025-03-08 05:38:17,692 INFO L226 Difference]: Without dead ends: 594 [2025-03-08 05:38:17,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:17,695 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 845 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:17,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 872 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:17,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-08 05:38:17,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2025-03-08 05:38:17,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 442 states have (on average 1.4841628959276019) internal successors, (656), 459 states have internal predecessors, (656), 107 states have call successors, (107), 44 states have call predecessors, (107), 44 states have return successors, (106), 105 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-08 05:38:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 869 transitions. [2025-03-08 05:38:17,741 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 869 transitions. Word has length 132 [2025-03-08 05:38:17,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:17,742 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 869 transitions. [2025-03-08 05:38:17,743 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:38:17,743 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 869 transitions. [2025-03-08 05:38:17,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 05:38:17,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:17,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:17,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:38:17,746 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:17,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:17,747 INFO L85 PathProgramCache]: Analyzing trace with hash 707506373, now seen corresponding path program 1 times [2025-03-08 05:38:17,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:17,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833320152] [2025-03-08 05:38:17,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:17,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:17,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 05:38:17,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 05:38:17,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:17,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:17,857 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-08 05:38:17,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:17,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833320152] [2025-03-08 05:38:17,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833320152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:17,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:17,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:38:17,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337825675] [2025-03-08 05:38:17,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:17,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:17,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:17,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:17,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:17,858 INFO L87 Difference]: Start difference. First operand 594 states and 869 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:38:17,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:17,902 INFO L93 Difference]: Finished difference Result 1157 states and 1708 transitions. [2025-03-08 05:38:17,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:17,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 155 [2025-03-08 05:38:17,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:17,905 INFO L225 Difference]: With dead ends: 1157 [2025-03-08 05:38:17,905 INFO L226 Difference]: Without dead ends: 593 [2025-03-08 05:38:17,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:17,909 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 831 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:17,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 890 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:17,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-08 05:38:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2025-03-08 05:38:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 442 states have (on average 1.4796380090497738) internal successors, (654), 458 states have internal predecessors, (654), 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-08 05:38:17,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 865 transitions. [2025-03-08 05:38:17,941 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 865 transitions. Word has length 155 [2025-03-08 05:38:17,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:17,941 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 865 transitions. [2025-03-08 05:38:17,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:38:17,941 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 865 transitions. [2025-03-08 05:38:17,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 05:38:17,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:17,944 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:17,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:38:17,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:17,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:17,946 INFO L85 PathProgramCache]: Analyzing trace with hash 40653138, now seen corresponding path program 1 times [2025-03-08 05:38:17,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:17,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651814093] [2025-03-08 05:38:17,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:17,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:17,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 05:38:18,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 05:38:18,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:18,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:18,069 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-08 05:38:18,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:18,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651814093] [2025-03-08 05:38:18,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651814093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:18,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:18,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:38:18,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004448831] [2025-03-08 05:38:18,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:18,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:18,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:18,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:18,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:18,070 INFO L87 Difference]: Start difference. First operand 593 states and 865 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (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-08 05:38:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:18,131 INFO L93 Difference]: Finished difference Result 1137 states and 1666 transitions. [2025-03-08 05:38:18,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:18,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (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 149 [2025-03-08 05:38:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:18,135 INFO L225 Difference]: With dead ends: 1137 [2025-03-08 05:38:18,136 INFO L226 Difference]: Without dead ends: 590 [2025-03-08 05:38:18,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:18,138 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 803 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:18,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 867 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:18,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-03-08 05:38:18,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-03-08 05:38:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 442 states have (on average 1.4547511312217194) internal successors, (643), 453 states have internal predecessors, (643), 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-08 05:38:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 848 transitions. [2025-03-08 05:38:18,167 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 848 transitions. Word has length 149 [2025-03-08 05:38:18,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:18,169 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 848 transitions. [2025-03-08 05:38:18,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (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-08 05:38:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 848 transitions. [2025-03-08 05:38:18,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 05:38:18,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:18,171 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:18,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:38:18,172 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:18,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:18,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1705881319, now seen corresponding path program 1 times [2025-03-08 05:38:18,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:18,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178275482] [2025-03-08 05:38:18,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:18,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:18,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 05:38:18,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 05:38:18,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:18,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-08 05:38:18,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:18,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178275482] [2025-03-08 05:38:18,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178275482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:38:18,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318383688] [2025-03-08 05:38:18,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:18,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:38:18,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:38:18,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:38:18,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:38:18,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 05:38:18,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 05:38:18,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:18,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:18,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 1383 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:38:18,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:38:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 05:38:18,746 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:38:18,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318383688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:18,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:38:18,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-08 05:38:18,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034323816] [2025-03-08 05:38:18,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:18,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:18,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:18,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:18,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:38:18,747 INFO L87 Difference]: Start difference. First operand 590 states and 848 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (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-08 05:38:18,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:18,801 INFO L93 Difference]: Finished difference Result 915 states and 1297 transitions. [2025-03-08 05:38:18,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:18,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (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 167 [2025-03-08 05:38:18,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:18,807 INFO L225 Difference]: With dead ends: 915 [2025-03-08 05:38:18,807 INFO L226 Difference]: Without dead ends: 591 [2025-03-08 05:38:18,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 167 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-08 05:38:18,809 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 0 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:18,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1688 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-08 05:38:18,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-03-08 05:38:18,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 443 states have (on average 1.4537246049661399) internal successors, (644), 454 states have internal predecessors, (644), 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-08 05:38:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 849 transitions. [2025-03-08 05:38:18,845 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 849 transitions. Word has length 167 [2025-03-08 05:38:18,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:18,847 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 849 transitions. [2025-03-08 05:38:18,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (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-08 05:38:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 849 transitions. [2025-03-08 05:38:18,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-08 05:38:18,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:18,850 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:18,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:38:19,050 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-08 05:38:19,051 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:19,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:19,052 INFO L85 PathProgramCache]: Analyzing trace with hash -221802188, now seen corresponding path program 1 times [2025-03-08 05:38:19,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:19,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612368294] [2025-03-08 05:38:19,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:19,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:19,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 05:38:19,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 05:38:19,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:19,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-08 05:38:19,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:19,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612368294] [2025-03-08 05:38:19,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612368294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:38:19,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078480683] [2025-03-08 05:38:19,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:19,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:38:19,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:38:19,305 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:38:19,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:38:19,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 05:38:19,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 05:38:19,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:19,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:19,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 1396 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:38:19,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:38:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 05:38:19,653 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:38:19,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078480683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:19,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:38:19,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-08 05:38:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927112378] [2025-03-08 05:38:19,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:19,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:19,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:19,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:19,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:38:19,655 INFO L87 Difference]: Start difference. First operand 591 states and 849 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (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-08 05:38:19,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:19,694 INFO L93 Difference]: Finished difference Result 1201 states and 1758 transitions. [2025-03-08 05:38:19,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:19,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (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 173 [2025-03-08 05:38:19,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:19,698 INFO L225 Difference]: With dead ends: 1201 [2025-03-08 05:38:19,699 INFO L226 Difference]: Without dead ends: 687 [2025-03-08 05:38:19,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 173 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-08 05:38:19,701 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 165 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:19,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1651 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:19,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-03-08 05:38:19,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 679. [2025-03-08 05:38:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 517 states have (on average 1.4700193423597678) internal successors, (760), 528 states have internal predecessors, (760), 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-08 05:38:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 993 transitions. [2025-03-08 05:38:19,734 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 993 transitions. Word has length 173 [2025-03-08 05:38:19,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:19,734 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 993 transitions. [2025-03-08 05:38:19,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (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-08 05:38:19,735 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 993 transitions. [2025-03-08 05:38:19,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 05:38:19,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:19,737 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:19,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:38:19,938 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-08 05:38:19,938 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:19,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:19,938 INFO L85 PathProgramCache]: Analyzing trace with hash 19989344, now seen corresponding path program 1 times [2025-03-08 05:38:19,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:19,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601994878] [2025-03-08 05:38:19,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:19,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:19,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 05:38:19,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 05:38:19,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:19,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-08 05:38:20,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:20,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601994878] [2025-03-08 05:38:20,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601994878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:38:20,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929725807] [2025-03-08 05:38:20,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:20,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:38:20,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:38:20,184 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:38:20,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:38:20,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 05:38:20,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 05:38:20,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:20,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:20,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 1431 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 05:38:20,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:38:20,564 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-08 05:38:20,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:38:20,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929725807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:20,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:38:20,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-08 05:38:20,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428677662] [2025-03-08 05:38:20,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:20,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:38:20,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:20,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:38:20,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:38:20,565 INFO L87 Difference]: Start difference. First operand 679 states and 993 transitions. Second operand has 8 states, 6 states have (on average 18.0) internal successors, (108), 8 states have internal predecessors, (108), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-08 05:38:20,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:20,680 INFO L93 Difference]: Finished difference Result 1305 states and 1923 transitions. [2025-03-08 05:38:20,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:38:20,680 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 18.0) internal successors, (108), 8 states have internal predecessors, (108), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 181 [2025-03-08 05:38:20,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:20,684 INFO L225 Difference]: With dead ends: 1305 [2025-03-08 05:38:20,685 INFO L226 Difference]: Without dead ends: 681 [2025-03-08 05:38:20,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 176 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-08 05:38:20,687 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 4 mSDsluCounter, 4993 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5828 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:20,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5828 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:38:20,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-08 05:38:20,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2025-03-08 05:38:20,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 518 states have (on average 1.4691119691119692) internal successors, (761), 530 states have internal predecessors, (761), 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-08 05:38:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 996 transitions. [2025-03-08 05:38:20,716 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 996 transitions. Word has length 181 [2025-03-08 05:38:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:20,716 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 996 transitions. [2025-03-08 05:38:20,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 18.0) internal successors, (108), 8 states have internal predecessors, (108), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-08 05:38:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 996 transitions. [2025-03-08 05:38:20,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 05:38:20,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:20,719 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:20,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:38:20,919 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-08 05:38:20,919 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:20,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:20,921 INFO L85 PathProgramCache]: Analyzing trace with hash -385700271, now seen corresponding path program 1 times [2025-03-08 05:38:20,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:20,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180660079] [2025-03-08 05:38:20,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:20,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:20,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 05:38:20,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 05:38:20,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:20,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 05:38:21,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:21,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180660079] [2025-03-08 05:38:21,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180660079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:38:21,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711556418] [2025-03-08 05:38:21,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:21,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:38:21,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:38:21,120 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:38:21,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:38:21,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 05:38:21,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 05:38:21,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:21,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:21,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 1402 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:38:21,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:38:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-08 05:38:21,476 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:38:21,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711556418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:21,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:38:21,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-08 05:38:21,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597674499] [2025-03-08 05:38:21,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:21,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:38:21,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:21,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:38:21,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:38:21,477 INFO L87 Difference]: Start difference. First operand 681 states and 996 transitions. Second operand has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 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-08 05:38:21,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:21,558 INFO L93 Difference]: Finished difference Result 1306 states and 1927 transitions. [2025-03-08 05:38:21,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:38:21,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 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 175 [2025-03-08 05:38:21,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:21,563 INFO L225 Difference]: With dead ends: 1306 [2025-03-08 05:38:21,564 INFO L226 Difference]: Without dead ends: 683 [2025-03-08 05:38:21,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 172 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-08 05:38:21,566 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 2 mSDsluCounter, 3323 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4158 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-08 05:38:21,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4158 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:21,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-03-08 05:38:21,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2025-03-08 05:38:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 519 states have (on average 1.4682080924855492) internal successors, (762), 532 states have internal predecessors, (762), 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-08 05:38:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1002 transitions. [2025-03-08 05:38:21,597 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1002 transitions. Word has length 175 [2025-03-08 05:38:21,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:21,597 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 1002 transitions. [2025-03-08 05:38:21,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 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-08 05:38:21,598 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1002 transitions. [2025-03-08 05:38:21,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 05:38:21,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:21,600 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:21,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:38:21,801 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-08 05:38:21,801 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:21,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:21,801 INFO L85 PathProgramCache]: Analyzing trace with hash 44285937, now seen corresponding path program 1 times [2025-03-08 05:38:21,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:21,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949811021] [2025-03-08 05:38:21,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:21,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:21,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 05:38:21,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 05:38:21,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:21,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-08 05:38:22,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:22,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949811021] [2025-03-08 05:38:22,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949811021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:22,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:22,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:38:22,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918620401] [2025-03-08 05:38:22,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:22,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:38:22,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:22,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:38:22,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:38:22,063 INFO L87 Difference]: Start difference. First operand 683 states and 1002 transitions. Second operand has 8 states, 6 states have (on average 17.666666666666668) internal successors, (106), 8 states have internal predecessors, (106), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-08 05:38:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:22,165 INFO L93 Difference]: Finished difference Result 1294 states and 1914 transitions. [2025-03-08 05:38:22,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:38:22,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 17.666666666666668) internal successors, (106), 8 states have internal predecessors, (106), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 183 [2025-03-08 05:38:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:22,170 INFO L225 Difference]: With dead ends: 1294 [2025-03-08 05:38:22,170 INFO L226 Difference]: Without dead ends: 683 [2025-03-08 05:38:22,172 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-08 05:38:22,173 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 4 mSDsluCounter, 4999 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5835 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-08 05:38:22,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5835 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:22,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-03-08 05:38:22,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2025-03-08 05:38:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 519 states have (on average 1.4682080924855492) internal successors, (762), 532 states have internal predecessors, (762), 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-08 05:38:22,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1001 transitions. [2025-03-08 05:38:22,204 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1001 transitions. Word has length 183 [2025-03-08 05:38:22,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:22,206 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 1001 transitions. [2025-03-08 05:38:22,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 17.666666666666668) internal successors, (106), 8 states have internal predecessors, (106), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-08 05:38:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1001 transitions. [2025-03-08 05:38:22,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 05:38:22,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:22,214 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:22,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:38:22,214 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:22,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:22,215 INFO L85 PathProgramCache]: Analyzing trace with hash 179783034, now seen corresponding path program 1 times [2025-03-08 05:38:22,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:22,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687223861] [2025-03-08 05:38:22,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:22,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:22,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 05:38:22,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 05:38:22,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:22,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-08 05:38:22,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:22,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687223861] [2025-03-08 05:38:22,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687223861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:22,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:22,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:38:22,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096589350] [2025-03-08 05:38:22,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:22,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:38:22,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:22,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:38:22,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:38:22,421 INFO L87 Difference]: Start difference. First operand 683 states and 1001 transitions. Second operand has 8 states, 6 states have (on average 17.0) internal successors, (102), 8 states have internal predecessors, (102), 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-08 05:38:22,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:22,525 INFO L93 Difference]: Finished difference Result 1296 states and 1917 transitions. [2025-03-08 05:38:22,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:38:22,527 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 17.0) internal successors, (102), 8 states have internal predecessors, (102), 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 177 [2025-03-08 05:38:22,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:22,532 INFO L225 Difference]: With dead ends: 1296 [2025-03-08 05:38:22,533 INFO L226 Difference]: Without dead ends: 685 [2025-03-08 05:38:22,535 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-08 05:38:22,536 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 3 mSDsluCounter, 5004 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5841 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-08 05:38:22,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5841 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:22,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-08 05:38:22,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2025-03-08 05:38:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 520 states have (on average 1.4673076923076922) internal successors, (763), 534 states have internal predecessors, (763), 117 states have call successors, (117), 44 states have call predecessors, (117), 47 states have return successors, (124), 115 states have call predecessors, (124), 116 states have call successors, (124) [2025-03-08 05:38:22,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1004 transitions. [2025-03-08 05:38:22,567 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1004 transitions. Word has length 177 [2025-03-08 05:38:22,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:22,568 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1004 transitions. [2025-03-08 05:38:22,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 17.0) internal successors, (102), 8 states have internal predecessors, (102), 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-08 05:38:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1004 transitions. [2025-03-08 05:38:22,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-08 05:38:22,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:22,571 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:22,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:38:22,571 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:22,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:22,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1900314443, now seen corresponding path program 1 times [2025-03-08 05:38:22,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:22,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352179212] [2025-03-08 05:38:22,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:22,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:22,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 05:38:22,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 05:38:22,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:22,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 05:38:22,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:22,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352179212] [2025-03-08 05:38:22,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352179212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:22,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:22,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:38:22,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394645229] [2025-03-08 05:38:22,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:22,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:38:22,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:22,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:38:22,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:38:22,730 INFO L87 Difference]: Start difference. First operand 685 states and 1004 transitions. Second operand has 9 states, 7 states have (on average 15.142857142857142) internal successors, (106), 8 states have internal predecessors, (106), 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-08 05:38:22,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:22,895 INFO L93 Difference]: Finished difference Result 1293 states and 1911 transitions. [2025-03-08 05:38:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:38:22,895 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 15.142857142857142) internal successors, (106), 8 states have internal predecessors, (106), 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 178 [2025-03-08 05:38:22,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:22,899 INFO L225 Difference]: With dead ends: 1293 [2025-03-08 05:38:22,899 INFO L226 Difference]: Without dead ends: 685 [2025-03-08 05:38:22,900 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-08 05:38:22,901 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 7 mSDsluCounter, 5773 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6602 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-08 05:38:22,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6602 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:38:22,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-08 05:38:22,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2025-03-08 05:38:22,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 520 states have (on average 1.4673076923076922) internal successors, (763), 534 states have internal predecessors, (763), 117 states have call successors, (117), 44 states have call predecessors, (117), 47 states have return successors, (123), 115 states have call predecessors, (123), 116 states have call successors, (123) [2025-03-08 05:38:22,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1003 transitions. [2025-03-08 05:38:22,928 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1003 transitions. Word has length 178 [2025-03-08 05:38:22,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:22,928 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1003 transitions. [2025-03-08 05:38:22,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 15.142857142857142) internal successors, (106), 8 states have internal predecessors, (106), 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-08 05:38:22,928 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1003 transitions. [2025-03-08 05:38:22,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 05:38:22,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:22,931 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:22,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:38:22,931 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:22,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:22,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1356734450, now seen corresponding path program 2 times [2025-03-08 05:38:22,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:22,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406841619] [2025-03-08 05:38:22,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:38:22,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:22,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 179 statements into 2 equivalence classes. [2025-03-08 05:38:22,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 05:38:22,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:38:22,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:23,074 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-08 05:38:23,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:23,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406841619] [2025-03-08 05:38:23,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406841619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:23,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:23,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:38:23,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475369542] [2025-03-08 05:38:23,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:23,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:38:23,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:23,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:38:23,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:38:23,076 INFO L87 Difference]: Start difference. First operand 685 states and 1003 transitions. Second operand has 8 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 4 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 05:38:23,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:23,165 INFO L93 Difference]: Finished difference Result 1295 states and 1917 transitions. [2025-03-08 05:38:23,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:38:23,165 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 4 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 179 [2025-03-08 05:38:23,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:23,169 INFO L225 Difference]: With dead ends: 1295 [2025-03-08 05:38:23,169 INFO L226 Difference]: Without dead ends: 687 [2025-03-08 05:38:23,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:38:23,171 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 1 mSDsluCounter, 4996 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 5833 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:23,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 5833 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:38:23,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-03-08 05:38:23,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2025-03-08 05:38:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 521 states have (on average 1.4664107485604607) internal successors, (764), 536 states have internal predecessors, (764), 117 states have call successors, (117), 44 states have call predecessors, (117), 48 states have return successors, (128), 115 states have call predecessors, (128), 116 states have call successors, (128) [2025-03-08 05:38:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1009 transitions. [2025-03-08 05:38:23,209 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1009 transitions. Word has length 179 [2025-03-08 05:38:23,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:23,209 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1009 transitions. [2025-03-08 05:38:23,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 4 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 05:38:23,210 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1009 transitions. [2025-03-08 05:38:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 05:38:23,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:23,212 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:23,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:38:23,212 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:23,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:23,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1565091993, now seen corresponding path program 1 times [2025-03-08 05:38:23,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:23,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754193297] [2025-03-08 05:38:23,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:23,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:23,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 05:38:23,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 05:38:23,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:23,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-08 05:38:23,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:23,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754193297] [2025-03-08 05:38:23,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754193297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:23,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:23,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:38:23,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241692932] [2025-03-08 05:38:23,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:23,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:38:23,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:23,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:38:23,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:38:23,324 INFO L87 Difference]: Start difference. First operand 687 states and 1009 transitions. Second operand has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 3 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 05:38:23,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:23,396 INFO L93 Difference]: Finished difference Result 1299 states and 1927 transitions. [2025-03-08 05:38:23,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:38:23,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 3 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 180 [2025-03-08 05:38:23,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:23,401 INFO L225 Difference]: With dead ends: 1299 [2025-03-08 05:38:23,401 INFO L226 Difference]: Without dead ends: 689 [2025-03-08 05:38:23,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:38:23,403 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 0 mSDsluCounter, 3323 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4158 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:23,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4158 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:23,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-03-08 05:38:23,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 687. [2025-03-08 05:38:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 521 states have (on average 1.4664107485604607) internal successors, (764), 536 states have internal predecessors, (764), 117 states have call successors, (117), 44 states have call predecessors, (117), 48 states have return successors, (128), 115 states have call predecessors, (128), 116 states have call successors, (128) [2025-03-08 05:38:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1009 transitions. [2025-03-08 05:38:23,430 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1009 transitions. Word has length 180 [2025-03-08 05:38:23,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:23,430 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1009 transitions. [2025-03-08 05:38:23,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 3 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 05:38:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1009 transitions. [2025-03-08 05:38:23,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 05:38:23,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:23,432 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:23,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:38:23,433 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:23,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:23,433 INFO L85 PathProgramCache]: Analyzing trace with hash 2048767320, now seen corresponding path program 1 times [2025-03-08 05:38:23,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:23,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901082141] [2025-03-08 05:38:23,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:23,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:23,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 05:38:23,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 05:38:23,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:23,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:38:23,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:23,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901082141] [2025-03-08 05:38:23,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901082141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:38:23,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848706699] [2025-03-08 05:38:23,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:23,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:38:23,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:38:23,546 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:38:23,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:38:23,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 05:38:23,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 05:38:23,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:23,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:23,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 1407 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:38:23,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:38:23,891 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:38:23,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:38:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:38:24,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848706699] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:38:24,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:38:24,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 05:38:24,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602970091] [2025-03-08 05:38:24,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:38:24,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:38:24,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:24,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:38:24,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:38:24,017 INFO L87 Difference]: Start difference. First operand 687 states and 1009 transitions. Second operand has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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-08 05:38:24,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:24,193 INFO L93 Difference]: Finished difference Result 1563 states and 2370 transitions. [2025-03-08 05:38:24,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:38:24,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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 180 [2025-03-08 05:38:24,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:24,200 INFO L225 Difference]: With dead ends: 1563 [2025-03-08 05:38:24,200 INFO L226 Difference]: Without dead ends: 1239 [2025-03-08 05:38:24,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:38:24,202 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 900 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 2419 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:24,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 2419 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:38:24,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2025-03-08 05:38:24,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1215. [2025-03-08 05:38:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 970 states have (on average 1.522680412371134) internal successors, (1477), 985 states have internal predecessors, (1477), 196 states have call successors, (196), 44 states have call predecessors, (196), 48 states have return successors, (217), 194 states have call predecessors, (217), 195 states have call successors, (217) [2025-03-08 05:38:24,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1890 transitions. [2025-03-08 05:38:24,243 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1890 transitions. Word has length 180 [2025-03-08 05:38:24,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:24,243 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1890 transitions. [2025-03-08 05:38:24,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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-08 05:38:24,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1890 transitions. [2025-03-08 05:38:24,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 05:38:24,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:24,248 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:24,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 05:38:24,455 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-08 05:38:24,455 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:24,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:24,455 INFO L85 PathProgramCache]: Analyzing trace with hash -451492340, now seen corresponding path program 1 times [2025-03-08 05:38:24,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:24,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58285712] [2025-03-08 05:38:24,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:24,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:24,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 05:38:24,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 05:38:24,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:24,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:24,518 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:38:24,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:24,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58285712] [2025-03-08 05:38:24,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58285712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:24,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:24,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:38:24,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126028252] [2025-03-08 05:38:24,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:24,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:24,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:24,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:24,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:24,519 INFO L87 Difference]: Start difference. First operand 1215 states and 1890 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:38:24,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:24,560 INFO L93 Difference]: Finished difference Result 2796 states and 4421 transitions. [2025-03-08 05:38:24,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:24,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 192 [2025-03-08 05:38:24,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:24,569 INFO L225 Difference]: With dead ends: 2796 [2025-03-08 05:38:24,570 INFO L226 Difference]: Without dead ends: 1712 [2025-03-08 05:38:24,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:24,573 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 163 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:24,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1699 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:24,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2025-03-08 05:38:24,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1704. [2025-03-08 05:38:24,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1380 states have (on average 1.5369565217391303) internal successors, (2121), 1395 states have internal predecessors, (2121), 275 states have call successors, (275), 44 states have call predecessors, (275), 48 states have return successors, (306), 273 states have call predecessors, (306), 274 states have call successors, (306) [2025-03-08 05:38:24,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2702 transitions. [2025-03-08 05:38:24,653 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2702 transitions. Word has length 192 [2025-03-08 05:38:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:24,653 INFO L471 AbstractCegarLoop]: Abstraction has 1704 states and 2702 transitions. [2025-03-08 05:38:24,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:38:24,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2702 transitions. [2025-03-08 05:38:24,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-08 05:38:24,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:24,660 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:24,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:38:24,660 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:24,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:24,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1244403770, now seen corresponding path program 1 times [2025-03-08 05:38:24,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:24,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013040680] [2025-03-08 05:38:24,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:24,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:24,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 05:38:24,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 05:38:24,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:24,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:38:24,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:24,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013040680] [2025-03-08 05:38:24,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013040680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:24,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:24,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:38:24,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491237371] [2025-03-08 05:38:24,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:24,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:24,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:24,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:24,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:24,723 INFO L87 Difference]: Start difference. First operand 1704 states and 2702 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:38:24,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:24,774 INFO L93 Difference]: Finished difference Result 4015 states and 6434 transitions. [2025-03-08 05:38:24,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:24,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 193 [2025-03-08 05:38:24,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:24,789 INFO L225 Difference]: With dead ends: 4015 [2025-03-08 05:38:24,789 INFO L226 Difference]: Without dead ends: 2501 [2025-03-08 05:38:24,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:24,795 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 161 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:24,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1684 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:24,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501 states. [2025-03-08 05:38:24,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 2493. [2025-03-08 05:38:24,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2493 states, 2050 states have (on average 1.5517073170731708) internal successors, (3181), 2065 states have internal predecessors, (3181), 394 states have call successors, (394), 44 states have call predecessors, (394), 48 states have return successors, (425), 392 states have call predecessors, (425), 393 states have call successors, (425) [2025-03-08 05:38:24,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 4000 transitions. [2025-03-08 05:38:24,874 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 4000 transitions. Word has length 193 [2025-03-08 05:38:24,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:24,874 INFO L471 AbstractCegarLoop]: Abstraction has 2493 states and 4000 transitions. [2025-03-08 05:38:24,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:38:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 4000 transitions. [2025-03-08 05:38:24,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 05:38:24,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:24,883 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:24,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:38:24,884 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:24,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:24,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1831702379, now seen corresponding path program 1 times [2025-03-08 05:38:24,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:24,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172835505] [2025-03-08 05:38:24,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:24,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:24,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 05:38:24,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 05:38:24,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:24,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:24,961 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:38:24,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:24,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172835505] [2025-03-08 05:38:24,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172835505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:24,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:24,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:38:24,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74246123] [2025-03-08 05:38:24,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:24,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:24,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:24,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:24,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:24,964 INFO L87 Difference]: Start difference. First operand 2493 states and 4000 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:38:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:25,035 INFO L93 Difference]: Finished difference Result 5868 states and 9511 transitions. [2025-03-08 05:38:25,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:25,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 194 [2025-03-08 05:38:25,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:25,053 INFO L225 Difference]: With dead ends: 5868 [2025-03-08 05:38:25,053 INFO L226 Difference]: Without dead ends: 3715 [2025-03-08 05:38:25,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:25,061 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 159 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:25,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1679 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:25,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3715 states. [2025-03-08 05:38:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3715 to 3707. [2025-03-08 05:38:25,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3707 states, 3102 states have (on average 1.5641521598968406) internal successors, (4852), 3117 states have internal predecessors, (4852), 556 states have call successors, (556), 44 states have call predecessors, (556), 48 states have return successors, (603), 554 states have call predecessors, (603), 555 states have call successors, (603) [2025-03-08 05:38:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 6011 transitions. [2025-03-08 05:38:25,189 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 6011 transitions. Word has length 194 [2025-03-08 05:38:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:25,190 INFO L471 AbstractCegarLoop]: Abstraction has 3707 states and 6011 transitions. [2025-03-08 05:38:25,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:38:25,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 6011 transitions. [2025-03-08 05:38:25,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 05:38:25,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:25,203 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:25,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:38:25,203 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:25,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:25,204 INFO L85 PathProgramCache]: Analyzing trace with hash -907555122, now seen corresponding path program 1 times [2025-03-08 05:38:25,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:25,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578252841] [2025-03-08 05:38:25,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:25,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:25,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 05:38:25,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 05:38:25,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:25,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:38:25,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:25,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578252841] [2025-03-08 05:38:25,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578252841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:25,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:25,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:38:25,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432152262] [2025-03-08 05:38:25,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:25,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:25,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:25,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:25,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:25,269 INFO L87 Difference]: Start difference. First operand 3707 states and 6011 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-08 05:38:25,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:25,379 INFO L93 Difference]: Finished difference Result 8793 states and 14386 transitions. [2025-03-08 05:38:25,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:25,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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 188 [2025-03-08 05:38:25,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:25,414 INFO L225 Difference]: With dead ends: 8793 [2025-03-08 05:38:25,415 INFO L226 Difference]: Without dead ends: 5674 [2025-03-08 05:38:25,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:25,429 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 157 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:25,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1679 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:25,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5674 states. [2025-03-08 05:38:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5674 to 5666. [2025-03-08 05:38:25,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5666 states, 4816 states have (on average 1.5745431893687707) internal successors, (7583), 4831 states have internal predecessors, (7583), 801 states have call successors, (801), 44 states have call predecessors, (801), 48 states have return successors, (874), 799 states have call predecessors, (874), 800 states have call successors, (874) [2025-03-08 05:38:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5666 states to 5666 states and 9258 transitions. [2025-03-08 05:38:25,776 INFO L78 Accepts]: Start accepts. Automaton has 5666 states and 9258 transitions. Word has length 188 [2025-03-08 05:38:25,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:25,777 INFO L471 AbstractCegarLoop]: Abstraction has 5666 states and 9258 transitions. [2025-03-08 05:38:25,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-08 05:38:25,782 INFO L276 IsEmpty]: Start isEmpty. Operand 5666 states and 9258 transitions. [2025-03-08 05:38:25,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 05:38:25,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:25,802 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:25,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:38:25,803 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:25,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:25,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1468095638, now seen corresponding path program 1 times [2025-03-08 05:38:25,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:25,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447153518] [2025-03-08 05:38:25,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:25,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:25,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 05:38:25,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 05:38:25,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:25,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:25,896 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:38:25,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:25,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447153518] [2025-03-08 05:38:25,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447153518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:25,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:25,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:38:25,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114265837] [2025-03-08 05:38:25,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:25,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:25,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:25,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:25,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:25,898 INFO L87 Difference]: Start difference. First operand 5666 states and 9258 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:38:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:26,087 INFO L93 Difference]: Finished difference Result 13653 states and 22451 transitions. [2025-03-08 05:38:26,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:26,088 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 196 [2025-03-08 05:38:26,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:26,132 INFO L225 Difference]: With dead ends: 13653 [2025-03-08 05:38:26,132 INFO L226 Difference]: Without dead ends: 8955 [2025-03-08 05:38:26,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:26,149 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 155 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:26,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1692 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:26,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8955 states. [2025-03-08 05:38:26,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8955 to 8947. [2025-03-08 05:38:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8947 states, 7604 states have (on average 1.573250920568122) internal successors, (11963), 7619 states have internal predecessors, (11963), 1294 states have call successors, (1294), 44 states have call predecessors, (1294), 48 states have return successors, (1411), 1292 states have call predecessors, (1411), 1293 states have call successors, (1411) [2025-03-08 05:38:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8947 states to 8947 states and 14668 transitions. [2025-03-08 05:38:26,468 INFO L78 Accepts]: Start accepts. Automaton has 8947 states and 14668 transitions. Word has length 196 [2025-03-08 05:38:26,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:26,469 INFO L471 AbstractCegarLoop]: Abstraction has 8947 states and 14668 transitions. [2025-03-08 05:38:26,469 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:38:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 8947 states and 14668 transitions. [2025-03-08 05:38:26,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 05:38:26,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:26,487 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:26,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:38:26,488 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:26,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:26,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1141733869, now seen corresponding path program 1 times [2025-03-08 05:38:26,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:26,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519131015] [2025-03-08 05:38:26,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:26,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:26,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 05:38:26,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 05:38:26,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:26,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:38:26,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:26,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519131015] [2025-03-08 05:38:26,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519131015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:26,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:26,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:38:26,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059469393] [2025-03-08 05:38:26,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:26,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:26,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:26,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:26,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:26,582 INFO L87 Difference]: Start difference. First operand 8947 states and 14668 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-08 05:38:26,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:26,865 INFO L93 Difference]: Finished difference Result 22368 states and 36978 transitions. [2025-03-08 05:38:26,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:26,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 190 [2025-03-08 05:38:26,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:26,912 INFO L225 Difference]: With dead ends: 22368 [2025-03-08 05:38:26,912 INFO L226 Difference]: Without dead ends: 14863 [2025-03-08 05:38:26,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:26,929 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 153 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:26,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1684 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:26,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14863 states. [2025-03-08 05:38:27,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14863 to 14855. [2025-03-08 05:38:27,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14855 states, 12690 states have (on average 1.5799054373522459) internal successors, (20049), 12705 states have internal predecessors, (20049), 2116 states have call successors, (2116), 44 states have call predecessors, (2116), 48 states have return successors, (2311), 2114 states have call predecessors, (2311), 2115 states have call successors, (2311) [2025-03-08 05:38:27,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14855 states to 14855 states and 24476 transitions. [2025-03-08 05:38:27,453 INFO L78 Accepts]: Start accepts. Automaton has 14855 states and 24476 transitions. Word has length 190 [2025-03-08 05:38:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:27,453 INFO L471 AbstractCegarLoop]: Abstraction has 14855 states and 24476 transitions. [2025-03-08 05:38:27,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-08 05:38:27,454 INFO L276 IsEmpty]: Start isEmpty. Operand 14855 states and 24476 transitions. [2025-03-08 05:38:27,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 05:38:27,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:27,482 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:27,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:38:27,482 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:27,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:27,483 INFO L85 PathProgramCache]: Analyzing trace with hash 549181248, now seen corresponding path program 1 times [2025-03-08 05:38:27,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:27,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545496492] [2025-03-08 05:38:27,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:27,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:27,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 05:38:27,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 05:38:27,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:27,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:38:27,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:27,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545496492] [2025-03-08 05:38:27,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545496492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:27,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:27,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:38:27,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324419435] [2025-03-08 05:38:27,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:27,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:27,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:27,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:27,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:27,557 INFO L87 Difference]: Start difference. First operand 14855 states and 24476 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (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-08 05:38:28,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:28,164 INFO L93 Difference]: Finished difference Result 35737 states and 58641 transitions. [2025-03-08 05:38:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:28,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (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 191 [2025-03-08 05:38:28,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:28,243 INFO L225 Difference]: With dead ends: 35737 [2025-03-08 05:38:28,244 INFO L226 Difference]: Without dead ends: 23429 [2025-03-08 05:38:28,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:28,274 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 151 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:28,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1675 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:28,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23429 states. [2025-03-08 05:38:28,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23429 to 23421. [2025-03-08 05:38:28,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23421 states, 20053 states have (on average 1.5540816835386226) internal successors, (31164), 20068 states have internal predecessors, (31164), 3319 states have call successors, (3319), 44 states have call predecessors, (3319), 48 states have return successors, (3658), 3317 states have call predecessors, (3658), 3318 states have call successors, (3658) [2025-03-08 05:38:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23421 states to 23421 states and 38141 transitions. [2025-03-08 05:38:29,002 INFO L78 Accepts]: Start accepts. Automaton has 23421 states and 38141 transitions. Word has length 191 [2025-03-08 05:38:29,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:29,002 INFO L471 AbstractCegarLoop]: Abstraction has 23421 states and 38141 transitions. [2025-03-08 05:38:29,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (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-08 05:38:29,002 INFO L276 IsEmpty]: Start isEmpty. Operand 23421 states and 38141 transitions. [2025-03-08 05:38:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-08 05:38:29,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:29,028 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:29,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:38:29,029 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:29,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:29,029 INFO L85 PathProgramCache]: Analyzing trace with hash -961353283, now seen corresponding path program 1 times [2025-03-08 05:38:29,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:29,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649399688] [2025-03-08 05:38:29,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:29,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:29,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 05:38:29,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 05:38:29,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:29,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:38:29,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:29,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649399688] [2025-03-08 05:38:29,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649399688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:29,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:29,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:38:29,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619293490] [2025-03-08 05:38:29,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:29,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:29,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:29,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:29,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:29,088 INFO L87 Difference]: Start difference. First operand 23421 states and 38141 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:38:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:29,746 INFO L93 Difference]: Finished difference Result 61755 states and 100954 transitions. [2025-03-08 05:38:29,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:29,747 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 199 [2025-03-08 05:38:29,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:29,899 INFO L225 Difference]: With dead ends: 61755 [2025-03-08 05:38:29,900 INFO L226 Difference]: Without dead ends: 41656 [2025-03-08 05:38:30,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:30,069 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 149 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:30,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1683 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:30,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41656 states. [2025-03-08 05:38:31,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41656 to 41648. [2025-03-08 05:38:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41648 states, 35830 states have (on average 1.55442366731789) internal successors, (55695), 35845 states have internal predecessors, (55695), 5769 states have call successors, (5769), 44 states have call predecessors, (5769), 48 states have return successors, (6382), 5767 states have call predecessors, (6382), 5768 states have call successors, (6382) [2025-03-08 05:38:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41648 states to 41648 states and 67846 transitions. [2025-03-08 05:38:31,624 INFO L78 Accepts]: Start accepts. Automaton has 41648 states and 67846 transitions. Word has length 199 [2025-03-08 05:38:31,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:31,626 INFO L471 AbstractCegarLoop]: Abstraction has 41648 states and 67846 transitions. [2025-03-08 05:38:31,626 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:38:31,626 INFO L276 IsEmpty]: Start isEmpty. Operand 41648 states and 67846 transitions. [2025-03-08 05:38:31,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-08 05:38:31,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:31,654 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:31,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:38:31,654 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:31,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:31,655 INFO L85 PathProgramCache]: Analyzing trace with hash -469443800, now seen corresponding path program 1 times [2025-03-08 05:38:31,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:31,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074393934] [2025-03-08 05:38:31,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:31,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:31,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 05:38:31,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 05:38:31,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:31,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:31,711 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:38:31,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:31,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074393934] [2025-03-08 05:38:31,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074393934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:31,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:31,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:38:31,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561055739] [2025-03-08 05:38:31,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:31,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:31,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:31,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:31,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:31,713 INFO L87 Difference]: Start difference. First operand 41648 states and 67846 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:38:33,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:33,131 INFO L93 Difference]: Finished difference Result 112802 states and 184761 transitions. [2025-03-08 05:38:33,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:33,131 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 200 [2025-03-08 05:38:33,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:33,419 INFO L225 Difference]: With dead ends: 112802 [2025-03-08 05:38:33,420 INFO L226 Difference]: Without dead ends: 75606 [2025-03-08 05:38:33,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:33,498 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 147 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:33,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1682 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:33,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75606 states. [2025-03-08 05:38:35,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75606 to 75598. [2025-03-08 05:38:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75598 states, 65267 states have (on average 1.5585977599705825) internal successors, (101725), 65282 states have internal predecessors, (101725), 10282 states have call successors, (10282), 44 states have call predecessors, (10282), 48 states have return successors, (11427), 10280 states have call predecessors, (11427), 10281 states have call successors, (11427) [2025-03-08 05:38:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75598 states to 75598 states and 123434 transitions. [2025-03-08 05:38:36,031 INFO L78 Accepts]: Start accepts. Automaton has 75598 states and 123434 transitions. Word has length 200 [2025-03-08 05:38:36,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:36,032 INFO L471 AbstractCegarLoop]: Abstraction has 75598 states and 123434 transitions. [2025-03-08 05:38:36,032 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:38:36,032 INFO L276 IsEmpty]: Start isEmpty. Operand 75598 states and 123434 transitions. [2025-03-08 05:38:36,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 05:38:36,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:36,065 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:36,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 05:38:36,066 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:36,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:36,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1865695435, now seen corresponding path program 1 times [2025-03-08 05:38:36,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:36,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301218343] [2025-03-08 05:38:36,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:36,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:36,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 05:38:36,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 05:38:36,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:36,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:38:36,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:36,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301218343] [2025-03-08 05:38:36,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301218343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:36,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:36,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:38:36,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917041045] [2025-03-08 05:38:36,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:36,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:36,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:36,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:36,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:36,124 INFO L87 Difference]: Start difference. First operand 75598 states and 123434 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, (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-08 05:38:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:39,077 INFO L93 Difference]: Finished difference Result 141234 states and 231424 transitions. [2025-03-08 05:38:39,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:39,078 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, (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 194 [2025-03-08 05:38:39,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:39,781 INFO L225 Difference]: With dead ends: 141234 [2025-03-08 05:38:39,782 INFO L226 Difference]: Without dead ends: 140910 [2025-03-08 05:38:39,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:39,825 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 141 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:39,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1698 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:39,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140910 states. [2025-03-08 05:38:43,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140910 to 140902. [2025-03-08 05:38:43,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140902 states, 122203 states have (on average 1.5579404760930582) internal successors, (190385), 122218 states have internal predecessors, (190385), 18650 states have call successors, (18650), 44 states have call predecessors, (18650), 48 states have return successors, (20841), 18648 states have call predecessors, (20841), 18649 states have call successors, (20841) [2025-03-08 05:38:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140902 states to 140902 states and 229876 transitions. [2025-03-08 05:38:44,331 INFO L78 Accepts]: Start accepts. Automaton has 140902 states and 229876 transitions. Word has length 194 [2025-03-08 05:38:44,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:44,332 INFO L471 AbstractCegarLoop]: Abstraction has 140902 states and 229876 transitions. [2025-03-08 05:38:44,332 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, (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-08 05:38:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 140902 states and 229876 transitions. [2025-03-08 05:38:44,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-08 05:38:44,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:44,628 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:44,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 05:38:44,629 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:44,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:44,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1797945282, now seen corresponding path program 1 times [2025-03-08 05:38:44,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:44,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978622202] [2025-03-08 05:38:44,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:44,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:44,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 05:38:44,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 05:38:44,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:44,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:38:44,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:44,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978622202] [2025-03-08 05:38:44,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978622202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:44,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:44,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 05:38:44,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469032624] [2025-03-08 05:38:44,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:44,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 05:38:44,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:44,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 05:38:44,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:38:44,963 INFO L87 Difference]: Start difference. First operand 140902 states and 229876 transitions. Second operand has 14 states, 12 states have (on average 9.75) internal successors, (117), 12 states have internal predecessors, (117), 7 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2025-03-08 05:38:51,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:51,551 INFO L93 Difference]: Finished difference Result 280838 states and 463651 transitions. [2025-03-08 05:38:51,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 05:38:51,551 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 9.75) internal successors, (117), 12 states have internal predecessors, (117), 7 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 195 [2025-03-08 05:38:51,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:52,930 INFO L225 Difference]: With dead ends: 280838 [2025-03-08 05:38:52,931 INFO L226 Difference]: Without dead ends: 280520 [2025-03-08 05:38:53,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2025-03-08 05:38:53,026 INFO L435 NwaCegarLoop]: 1002 mSDtfsCounter, 2101 mSDsluCounter, 9843 mSDsCounter, 0 mSdLazyCounter, 2260 mSolverCounterSat, 762 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2101 SdHoareTripleChecker+Valid, 10845 SdHoareTripleChecker+Invalid, 3022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 762 IncrementalHoareTripleChecker+Valid, 2260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:53,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2101 Valid, 10845 Invalid, 3022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [762 Valid, 2260 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 05:38:53,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280520 states.