./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec9_productSimulator.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a46e94d21677d8e787ff51041171bb0d6a97c638f1cb1f2181c1b14c15718344 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:58:49,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:58:49,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:58:49,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:58:49,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:58:49,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:58:49,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:58:49,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:58:49,418 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:58:49,418 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:58:49,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:58:49,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:58:49,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:58:49,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:58:49,418 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:58:49,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:58:49,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:58:49,419 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:58:49,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:58:49,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:58:49,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:58:49,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:58:49,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:58:49,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:58:49,419 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:58:49,419 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:58:49,419 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:58:49,420 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:58:49,420 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:58:49,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:58:49,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:58:49,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:58:49,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:58:49,420 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:58:49,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:58:49,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:58:49,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:58:49,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:58:49,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:58:49,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:58:49,421 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:58:49,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:58:49,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:58:49,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:58:49,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:58:49,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:58:49,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:58:49,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:58:49,421 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a46e94d21677d8e787ff51041171bb0d6a97c638f1cb1f2181c1b14c15718344 [2025-01-09 03:58:49,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:58:49,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:58:49,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:58:49,678 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:58:49,678 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:58:49,680 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec9_productSimulator.cil.c [2025-01-09 03:58:51,186 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd464743b/f9782ff61d2848daabf2166e88ac1a9d/FLAG53b698654 [2025-01-09 03:58:51,706 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:58:51,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_productSimulator.cil.c [2025-01-09 03:58:51,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd464743b/f9782ff61d2848daabf2166e88ac1a9d/FLAG53b698654 [2025-01-09 03:58:51,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd464743b/f9782ff61d2848daabf2166e88ac1a9d [2025-01-09 03:58:51,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:58:51,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:58:51,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:58:51,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:58:51,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:58:51,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:58:51" (1/1) ... [2025-01-09 03:58:51,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53dbe50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:51, skipping insertion in model container [2025-01-09 03:58:51,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:58:51" (1/1) ... [2025-01-09 03:58:51,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:58:52,195 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_productSimulator.cil.c[31629,31642] [2025-01-09 03:58:52,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:58:52,324 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:58:52,332 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-01-09 03:58:52,333 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [335] [2025-01-09 03:58:52,334 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [747] [2025-01-09 03:58:52,334 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1323] [2025-01-09 03:58:52,334 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1686] [2025-01-09 03:58:52,334 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1695] [2025-01-09 03:58:52,334 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [2061] [2025-01-09 03:58:52,334 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2103] [2025-01-09 03:58:52,334 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2210] [2025-01-09 03:58:52,334 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2414] [2025-01-09 03:58:52,334 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [2431] [2025-01-09 03:58:52,383 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_productSimulator.cil.c[31629,31642] [2025-01-09 03:58:52,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:58:52,499 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:58:52,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:52 WrapperNode [2025-01-09 03:58:52,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:58:52,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:58:52,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:58:52,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:58:52,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:52" (1/1) ... [2025-01-09 03:58:52,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:52" (1/1) ... [2025-01-09 03:58:52,606 INFO L138 Inliner]: procedures = 152, calls = 266, calls flagged for inlining = 68, calls inlined = 65, statements flattened = 1328 [2025-01-09 03:58:52,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:58:52,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:58:52,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:58:52,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:58:52,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:52" (1/1) ... [2025-01-09 03:58:52,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:52" (1/1) ... [2025-01-09 03:58:52,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:52" (1/1) ... [2025-01-09 03:58:52,658 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-01-09 03:58:52,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:52" (1/1) ... [2025-01-09 03:58:52,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:52" (1/1) ... [2025-01-09 03:58:52,671 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:52" (1/1) ... [2025-01-09 03:58:52,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:52" (1/1) ... [2025-01-09 03:58:52,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:52" (1/1) ... [2025-01-09 03:58:52,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:52" (1/1) ... [2025-01-09 03:58:52,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:52" (1/1) ... [2025-01-09 03:58:52,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:58:52,691 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:58:52,691 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:58:52,691 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:58:52,691 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:52" (1/1) ... [2025-01-09 03:58:52,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:58:52,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:52,718 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:58:52,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:58:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:58:52,740 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:58:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-01-09 03:58:52,740 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-01-09 03:58:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-01-09 03:58:52,741 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-01-09 03:58:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-01-09 03:58:52,741 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-01-09 03:58:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:58:52,741 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:58:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-01-09 03:58:52,741 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-01-09 03:58:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:58:52,741 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:58:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-01-09 03:58:52,741 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-01-09 03:58:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:58:52,742 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:58:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-01-09 03:58:52,742 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-01-09 03:58:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:58:52,742 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:58:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:58:52,742 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:58:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:58:52,742 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:58:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-01-09 03:58:52,742 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-01-09 03:58:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-01-09 03:58:52,742 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-01-09 03:58:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:58:52,743 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:58:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:58:52,743 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:58:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:58:52,743 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:58:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-01-09 03:58:52,743 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-01-09 03:58:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:58:52,743 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:58:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-01-09 03:58:52,743 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-01-09 03:58:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:58:52,744 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:58:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-01-09 03:58:52,744 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-01-09 03:58:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:58:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:58:52,744 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:58:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:58:52,744 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:58:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-01-09 03:58:52,744 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-01-09 03:58:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-01-09 03:58:52,744 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-01-09 03:58:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-01-09 03:58:52,744 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-01-09 03:58:52,745 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-01-09 03:58:52,745 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-01-09 03:58:52,745 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:58:52,745 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:58:52,745 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:58:52,745 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:58:52,745 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:58:52,745 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:58:52,745 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:58:52,745 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:58:52,745 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:58:52,745 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:58:52,745 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:58:52,745 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:58:52,746 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-01-09 03:58:52,746 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-01-09 03:58:52,746 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-01-09 03:58:52,746 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-01-09 03:58:52,746 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:58:52,746 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:58:52,746 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:58:52,746 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:58:52,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:58:52,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:58:52,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:58:52,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:58:52,746 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:58:52,746 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:58:52,746 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-01-09 03:58:52,746 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-01-09 03:58:52,747 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-01-09 03:58:52,747 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-01-09 03:58:52,747 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-01-09 03:58:52,747 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-01-09 03:58:52,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:58:52,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:58:52,950 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:58:52,954 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:58:54,203 INFO L? ?]: Removed 629 outVars from TransFormulas that were not future-live. [2025-01-09 03:58:54,203 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:58:54,230 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:58:54,235 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:58:54,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:58:54 BoogieIcfgContainer [2025-01-09 03:58:54,235 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:58:54,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:58:54,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:58:54,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:58:54,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:58:51" (1/3) ... [2025-01-09 03:58:54,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44196729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:58:54, skipping insertion in model container [2025-01-09 03:58:54,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:52" (2/3) ... [2025-01-09 03:58:54,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44196729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:58:54, skipping insertion in model container [2025-01-09 03:58:54,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:58:54" (3/3) ... [2025-01-09 03:58:54,246 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec9_productSimulator.cil.c [2025-01-09 03:58:54,260 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:58:54,263 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec9_productSimulator.cil.c that has 44 procedures, 603 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:58:54,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:58:54,339 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;@547ac8b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:58:54,339 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:58:54,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 603 states, 448 states have (on average 1.5133928571428572) internal successors, (678), 468 states have internal predecessors, (678), 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-01-09 03:58:54,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 03:58:54,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:54,362 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-01-09 03:58:54,363 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:54,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:54,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1732741696, now seen corresponding path program 1 times [2025-01-09 03:58:54,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:54,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804328406] [2025-01-09 03:58:54,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:54,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:54,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:58:54,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:58:54,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:54,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:55,130 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 03:58:55,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:55,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804328406] [2025-01-09 03:58:55,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804328406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:55,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:55,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:58:55,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494589436] [2025-01-09 03:58:55,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:55,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:58:55,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:55,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:58:55,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:58:55,157 INFO L87 Difference]: Start difference. First operand has 603 states, 448 states have (on average 1.5133928571428572) internal successors, (678), 468 states have internal predecessors, (678), 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-01-09 03:58:55,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:55,327 INFO L93 Difference]: Finished difference Result 1169 states and 1750 transitions. [2025-01-09 03:58:55,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:58:55,329 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-01-09 03:58:55,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:55,345 INFO L225 Difference]: With dead ends: 1169 [2025-01-09 03:58:55,347 INFO L226 Difference]: Without dead ends: 596 [2025-01-09 03:58:55,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:58:55,358 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 0 mSDsluCounter, 2663 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3555 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-01-09 03:58:55,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3555 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:55,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-01-09 03:58:55,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-01-09 03:58:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 442 states have (on average 1.495475113122172) internal successors, (661), 461 states have internal predecessors, (661), 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-01-09 03:58:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 880 transitions. [2025-01-09 03:58:55,452 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 880 transitions. Word has length 127 [2025-01-09 03:58:55,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:55,458 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 880 transitions. [2025-01-09 03:58:55,459 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-01-09 03:58:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 880 transitions. [2025-01-09 03:58:55,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 03:58:55,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:55,466 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-01-09 03:58:55,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:58:55,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:55,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:55,470 INFO L85 PathProgramCache]: Analyzing trace with hash -910236237, now seen corresponding path program 1 times [2025-01-09 03:58:55,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:55,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603329499] [2025-01-09 03:58:55,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:55,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:55,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 03:58:55,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 03:58:55,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:55,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:55,658 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 03:58:55,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:55,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603329499] [2025-01-09 03:58:55,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603329499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:55,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:55,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:55,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514235163] [2025-01-09 03:58:55,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:55,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:55,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:55,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:55,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:55,663 INFO L87 Difference]: Start difference. First operand 596 states and 880 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-01-09 03:58:55,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:55,742 INFO L93 Difference]: Finished difference Result 1166 states and 1742 transitions. [2025-01-09 03:58:55,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:55,743 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-01-09 03:58:55,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:55,749 INFO L225 Difference]: With dead ends: 1166 [2025-01-09 03:58:55,750 INFO L226 Difference]: Without dead ends: 595 [2025-01-09 03:58:55,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:55,752 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 846 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 873 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-01-09 03:58:55,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 873 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:55,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-01-09 03:58:55,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2025-01-09 03:58:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 443 states have (on average 1.4830699774266365) internal successors, (657), 460 states have internal predecessors, (657), 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-01-09 03:58:55,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 870 transitions. [2025-01-09 03:58:55,804 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 870 transitions. Word has length 132 [2025-01-09 03:58:55,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:55,804 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 870 transitions. [2025-01-09 03:58:55,805 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-01-09 03:58:55,805 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 870 transitions. [2025-01-09 03:58:55,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 03:58:55,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:55,809 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] [2025-01-09 03:58:55,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:58:55,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:55,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:55,810 INFO L85 PathProgramCache]: Analyzing trace with hash -851313787, now seen corresponding path program 1 times [2025-01-09 03:58:55,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:55,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766379904] [2025-01-09 03:58:55,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:55,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:55,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 03:58:55,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 03:58:55,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:55,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:55,937 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 03:58:55,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:55,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766379904] [2025-01-09 03:58:55,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766379904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:55,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:55,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:55,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208337453] [2025-01-09 03:58:55,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:55,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:55,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:55,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:55,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:55,939 INFO L87 Difference]: Start difference. First operand 595 states and 870 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (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-01-09 03:58:56,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:56,015 INFO L93 Difference]: Finished difference Result 1159 states and 1710 transitions. [2025-01-09 03:58:56,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:56,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (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 148 [2025-01-09 03:58:56,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:56,025 INFO L225 Difference]: With dead ends: 1159 [2025-01-09 03:58:56,025 INFO L226 Difference]: Without dead ends: 594 [2025-01-09 03:58:56,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:56,031 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 832 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 891 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-01-09 03:58:56,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 891 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:56,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-01-09 03:58:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2025-01-09 03:58:56,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 443 states have (on average 1.4785553047404063) internal successors, (655), 459 states have internal predecessors, (655), 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-01-09 03:58:56,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 866 transitions. [2025-01-09 03:58:56,074 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 866 transitions. Word has length 148 [2025-01-09 03:58:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:56,075 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 866 transitions. [2025-01-09 03:58:56,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (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-01-09 03:58:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 866 transitions. [2025-01-09 03:58:56,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 03:58:56,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:56,078 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, 1] [2025-01-09 03:58:56,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:58:56,078 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:56,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:56,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1956902226, now seen corresponding path program 1 times [2025-01-09 03:58:56,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:56,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654862894] [2025-01-09 03:58:56,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:56,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:56,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 03:58:56,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 03:58:56,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:56,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 03:58:56,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:56,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654862894] [2025-01-09 03:58:56,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654862894] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:56,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:56,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:56,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314385] [2025-01-09 03:58:56,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:56,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:56,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:56,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:56,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:56,209 INFO L87 Difference]: Start difference. First operand 594 states and 866 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (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-01-09 03:58:56,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:56,279 INFO L93 Difference]: Finished difference Result 1139 states and 1668 transitions. [2025-01-09 03:58:56,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:56,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (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 156 [2025-01-09 03:58:56,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:56,286 INFO L225 Difference]: With dead ends: 1139 [2025-01-09 03:58:56,287 INFO L226 Difference]: Without dead ends: 591 [2025-01-09 03:58:56,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:56,290 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 804 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 868 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-01-09 03:58:56,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 868 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:56,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-01-09 03:58:56,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-01-09 03:58:56,376 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-01-09 03:58:56,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 849 transitions. [2025-01-09 03:58:56,384 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 849 transitions. Word has length 156 [2025-01-09 03:58:56,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:56,385 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 849 transitions. [2025-01-09 03:58:56,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (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-01-09 03:58:56,385 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 849 transitions. [2025-01-09 03:58:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 03:58:56,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:56,393 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] [2025-01-09 03:58:56,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:58:56,394 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:56,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:56,394 INFO L85 PathProgramCache]: Analyzing trace with hash 649408825, now seen corresponding path program 1 times [2025-01-09 03:58:56,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:56,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860013801] [2025-01-09 03:58:56,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:56,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:56,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 03:58:56,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 03:58:56,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:56,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 03:58:56,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:56,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860013801] [2025-01-09 03:58:56,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860013801] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:58:56,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080102484] [2025-01-09 03:58:56,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:56,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:56,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:56,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:58:56,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:58:57,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 03:58:57,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 03:58:57,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:57,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:57,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 1413 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:58:57,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:58:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 03:58:57,265 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:58:57,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080102484] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:57,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:58:57,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 03:58:57,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660968761] [2025-01-09 03:58:57,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:57,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:57,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:57,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:57,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:58:57,268 INFO L87 Difference]: Start difference. First operand 591 states and 849 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 03:58:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:57,303 INFO L93 Difference]: Finished difference Result 917 states and 1299 transitions. [2025-01-09 03:58:57,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:57,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 174 [2025-01-09 03:58:57,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:57,306 INFO L225 Difference]: With dead ends: 917 [2025-01-09 03:58:57,307 INFO L226 Difference]: Without dead ends: 593 [2025-01-09 03:58:57,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 174 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-01-09 03:58:57,308 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 1 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:57,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1688 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:57,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-01-09 03:58:57,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 592. [2025-01-09 03:58:57,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 444 states have (on average 1.4527027027027026) internal successors, (645), 455 states have internal predecessors, (645), 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-01-09 03:58:57,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 850 transitions. [2025-01-09 03:58:57,333 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 850 transitions. Word has length 174 [2025-01-09 03:58:57,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:57,333 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 850 transitions. [2025-01-09 03:58:57,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 03:58:57,333 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 850 transitions. [2025-01-09 03:58:57,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 03:58:57,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:57,335 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] [2025-01-09 03:58:57,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:58:57,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:57,537 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:57,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:57,538 INFO L85 PathProgramCache]: Analyzing trace with hash 417204186, now seen corresponding path program 1 times [2025-01-09 03:58:57,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:57,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312464623] [2025-01-09 03:58:57,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:57,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:57,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 03:58:57,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 03:58:57,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:57,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:57,828 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-01-09 03:58:57,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:57,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312464623] [2025-01-09 03:58:57,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312464623] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:58:57,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629328242] [2025-01-09 03:58:57,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:57,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:57,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:57,835 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:58:57,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:58:58,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 03:58:58,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 03:58:58,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:58,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:58,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 1396 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:58:58,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:58:58,240 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 03:58:58,241 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:58:58,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629328242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:58,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:58:58,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 03:58:58,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903570835] [2025-01-09 03:58:58,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:58,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:58,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:58,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:58,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:58:58,243 INFO L87 Difference]: Start difference. First operand 592 states and 850 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-01-09 03:58:58,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:58,276 INFO L93 Difference]: Finished difference Result 1204 states and 1761 transitions. [2025-01-09 03:58:58,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:58,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 174 [2025-01-09 03:58:58,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:58,281 INFO L225 Difference]: With dead ends: 1204 [2025-01-09 03:58:58,281 INFO L226 Difference]: Without dead ends: 689 [2025-01-09 03:58:58,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 174 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-01-09 03:58:58,283 INFO L435 NwaCegarLoop]: 858 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, 1656 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:58,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1656 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:58,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-01-09 03:58:58,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 681. [2025-01-09 03:58:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 519 states have (on average 1.4682080924855492) internal successors, (762), 530 states have internal predecessors, (762), 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-01-09 03:58:58,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 995 transitions. [2025-01-09 03:58:58,311 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 995 transitions. Word has length 174 [2025-01-09 03:58:58,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:58,311 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 995 transitions. [2025-01-09 03:58:58,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-01-09 03:58:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 995 transitions. [2025-01-09 03:58:58,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 03:58:58,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:58,314 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] [2025-01-09 03:58:58,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:58:58,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:58,515 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:58,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:58,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1629116206, now seen corresponding path program 1 times [2025-01-09 03:58:58,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:58,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326331887] [2025-01-09 03:58:58,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:58,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:58,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 03:58:58,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 03:58:58,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:58,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-01-09 03:58:58,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:58,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326331887] [2025-01-09 03:58:58,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326331887] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:58:58,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078105360] [2025-01-09 03:58:58,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:58,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:58,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:58,733 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:58:58,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:58:58,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 03:58:59,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 03:58:59,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:59,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:59,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 1401 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 03:58:59,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:58:59,115 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-09 03:58:59,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:58:59,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078105360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:59,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:58:59,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-01-09 03:58:59,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962235142] [2025-01-09 03:58:59,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:59,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:58:59,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:59,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:58:59,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:58:59,117 INFO L87 Difference]: Start difference. First operand 681 states and 995 transitions. Second operand has 8 states, 6 states have (on average 17.333333333333332) internal successors, (104), 8 states have internal predecessors, (104), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 03:58:59,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:59,213 INFO L93 Difference]: Finished difference Result 1309 states and 1927 transitions. [2025-01-09 03:58:59,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:58:59,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 17.333333333333332) internal successors, (104), 8 states have internal predecessors, (104), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 175 [2025-01-09 03:58:59,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:59,218 INFO L225 Difference]: With dead ends: 1309 [2025-01-09 03:58:59,218 INFO L226 Difference]: Without dead ends: 683 [2025-01-09 03:58:59,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 170 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-01-09 03:58:59,220 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 4 mSDsluCounter, 4999 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5835 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-01-09 03:58:59,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5835 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:59,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-01-09 03:58:59,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2025-01-09 03:58:59,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 520 states have (on average 1.4673076923076922) internal successors, (763), 532 states have internal predecessors, (763), 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-01-09 03:58:59,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 998 transitions. [2025-01-09 03:58:59,247 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 998 transitions. Word has length 175 [2025-01-09 03:58:59,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:59,247 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 998 transitions. [2025-01-09 03:58:59,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 17.333333333333332) internal successors, (104), 8 states have internal predecessors, (104), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 03:58:59,247 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 998 transitions. [2025-01-09 03:58:59,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 03:58:59,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:59,249 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:59,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:58:59,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:59,450 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:59,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:59,451 INFO L85 PathProgramCache]: Analyzing trace with hash -310863095, now seen corresponding path program 1 times [2025-01-09 03:58:59,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:59,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774014702] [2025-01-09 03:58:59,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:59,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:59,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 03:58:59,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 03:58:59,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:59,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-09 03:58:59,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:59,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774014702] [2025-01-09 03:58:59,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774014702] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:58:59,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119672463] [2025-01-09 03:58:59,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:59,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:59,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:59,677 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:58:59,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:58:59,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 03:58:59,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 03:58:59,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:59,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:00,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:59:00,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:59:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-09 03:59:00,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:59:00,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119672463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:00,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:59:00,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-01-09 03:59:00,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304559653] [2025-01-09 03:59:00,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:00,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:59:00,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:00,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:59:00,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:59:00,060 INFO L87 Difference]: Start difference. First operand 683 states and 998 transitions. Second operand has 6 states, 5 states have (on average 22.2) internal successors, (111), 6 states have internal predecessors, (111), 3 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-01-09 03:59:00,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:00,132 INFO L93 Difference]: Finished difference Result 1310 states and 1931 transitions. [2025-01-09 03:59:00,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:59:00,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.2) internal successors, (111), 6 states have internal predecessors, (111), 3 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 183 [2025-01-09 03:59:00,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:00,136 INFO L225 Difference]: With dead ends: 1310 [2025-01-09 03:59:00,136 INFO L226 Difference]: Without dead ends: 685 [2025-01-09 03:59:00,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 180 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-01-09 03:59:00,139 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 2 mSDsluCounter, 3327 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4163 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-01-09 03:59:00,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4163 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:00,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-01-09 03:59:00,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2025-01-09 03:59:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 521 states have (on average 1.4664107485604607) internal successors, (764), 534 states have internal predecessors, (764), 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-01-09 03:59:00,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1004 transitions. [2025-01-09 03:59:00,171 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1004 transitions. Word has length 183 [2025-01-09 03:59:00,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:00,172 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1004 transitions. [2025-01-09 03:59:00,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.2) internal successors, (111), 6 states have internal predecessors, (111), 3 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-01-09 03:59:00,172 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1004 transitions. [2025-01-09 03:59:00,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 03:59:00,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:00,175 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] [2025-01-09 03:59:00,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:59:00,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 03:59:00,376 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:00,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:00,376 INFO L85 PathProgramCache]: Analyzing trace with hash 688921821, now seen corresponding path program 1 times [2025-01-09 03:59:00,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:00,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775175674] [2025-01-09 03:59:00,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:00,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:00,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 03:59:00,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 03:59:00,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:00,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:00,613 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-01-09 03:59:00,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:00,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775175674] [2025-01-09 03:59:00,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775175674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:00,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:00,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:59:00,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884021386] [2025-01-09 03:59:00,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:00,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:59:00,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:00,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:59:00,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:59:00,615 INFO L87 Difference]: Start difference. First operand 685 states and 1004 transitions. Second operand has 8 states, 6 states have (on average 17.833333333333332) internal successors, (107), 8 states have internal predecessors, (107), 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-01-09 03:59:00,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:00,713 INFO L93 Difference]: Finished difference Result 1298 states and 1918 transitions. [2025-01-09 03:59:00,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:59:00,715 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 17.833333333333332) internal successors, (107), 8 states have internal predecessors, (107), 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 184 [2025-01-09 03:59:00,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:00,720 INFO L225 Difference]: With dead ends: 1298 [2025-01-09 03:59:00,720 INFO L226 Difference]: Without dead ends: 685 [2025-01-09 03:59:00,722 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-01-09 03:59:00,722 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 4 mSDsluCounter, 5005 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5842 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-01-09 03:59:00,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5842 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:00,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-01-09 03:59:00,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2025-01-09 03:59:00,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 521 states have (on average 1.4664107485604607) internal successors, (764), 534 states have internal predecessors, (764), 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-01-09 03:59:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1003 transitions. [2025-01-09 03:59:00,754 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1003 transitions. Word has length 184 [2025-01-09 03:59:00,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:00,756 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1003 transitions. [2025-01-09 03:59:00,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 17.833333333333332) internal successors, (107), 8 states have internal predecessors, (107), 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-01-09 03:59:00,756 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1003 transitions. [2025-01-09 03:59:00,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-01-09 03:59:00,758 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:00,759 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, 1, 1, 1, 1, 1, 1] [2025-01-09 03:59:00,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:59:00,759 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:00,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:00,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1618425293, now seen corresponding path program 2 times [2025-01-09 03:59:00,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:00,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220906690] [2025-01-09 03:59:00,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:59:00,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:00,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 185 statements into 2 equivalence classes. [2025-01-09 03:59:00,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 03:59:00,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:59:00,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:00,949 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-01-09 03:59:00,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:00,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220906690] [2025-01-09 03:59:00,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220906690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:00,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:00,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:59:00,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308759731] [2025-01-09 03:59:00,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:00,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:59:00,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:00,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:59:00,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:59:00,952 INFO L87 Difference]: Start difference. First operand 685 states and 1003 transitions. Second operand has 6 states, 5 states have (on average 21.4) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-01-09 03:59:01,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:01,037 INFO L93 Difference]: Finished difference Result 1295 states and 1912 transitions. [2025-01-09 03:59:01,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:59:01,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.4) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 185 [2025-01-09 03:59:01,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:01,043 INFO L225 Difference]: With dead ends: 1295 [2025-01-09 03:59:01,043 INFO L226 Difference]: Without dead ends: 685 [2025-01-09 03:59:01,045 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-01-09 03:59:01,046 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 2 mSDsluCounter, 3331 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4168 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:01,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4168 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:01,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-01-09 03:59:01,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2025-01-09 03:59:01,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 521 states have (on average 1.4664107485604607) internal successors, (764), 534 states have internal predecessors, (764), 117 states have call successors, (117), 44 states have call predecessors, (117), 46 states have return successors, (121), 115 states have call predecessors, (121), 116 states have call successors, (121) [2025-01-09 03:59:01,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1002 transitions. [2025-01-09 03:59:01,078 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1002 transitions. Word has length 185 [2025-01-09 03:59:01,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:01,078 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1002 transitions. [2025-01-09 03:59:01,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.4) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-01-09 03:59:01,078 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1002 transitions. [2025-01-09 03:59:01,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 03:59:01,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:01,081 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:59:01,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:59:01,081 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:01,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:01,082 INFO L85 PathProgramCache]: Analyzing trace with hash 638776045, now seen corresponding path program 3 times [2025-01-09 03:59:01,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:01,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612392020] [2025-01-09 03:59:01,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:59:01,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:01,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 186 statements into 8 equivalence classes. [2025-01-09 03:59:01,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 139 of 186 statements. [2025-01-09 03:59:01,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:59:01,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-01-09 03:59:01,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:01,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612392020] [2025-01-09 03:59:01,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612392020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:01,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:01,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:59:01,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681609975] [2025-01-09 03:59:01,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:01,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:59:01,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:01,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:59:01,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:01,298 INFO L87 Difference]: Start difference. First operand 685 states and 1002 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-01-09 03:59:01,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:01,352 INFO L93 Difference]: Finished difference Result 1121 states and 1625 transitions. [2025-01-09 03:59:01,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:59:01,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 186 [2025-01-09 03:59:01,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:01,357 INFO L225 Difference]: With dead ends: 1121 [2025-01-09 03:59:01,358 INFO L226 Difference]: Without dead ends: 805 [2025-01-09 03:59:01,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:01,359 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 494 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:01,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1280 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:01,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-01-09 03:59:01,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 804. [2025-01-09 03:59:01,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 612 states have (on average 1.4803921568627452) internal successors, (906), 629 states have internal predecessors, (906), 135 states have call successors, (135), 58 states have call predecessors, (135), 56 states have return successors, (135), 126 states have call predecessors, (135), 130 states have call successors, (135) [2025-01-09 03:59:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1176 transitions. [2025-01-09 03:59:01,393 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1176 transitions. Word has length 186 [2025-01-09 03:59:01,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:01,394 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1176 transitions. [2025-01-09 03:59:01,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-01-09 03:59:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1176 transitions. [2025-01-09 03:59:01,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-09 03:59:01,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:01,400 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:59:01,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:59:01,400 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:01,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:01,401 INFO L85 PathProgramCache]: Analyzing trace with hash 592416871, now seen corresponding path program 1 times [2025-01-09 03:59:01,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:01,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092165801] [2025-01-09 03:59:01,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:01,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:01,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 03:59:01,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 03:59:01,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:01,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:01,702 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-01-09 03:59:01,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:01,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092165801] [2025-01-09 03:59:01,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092165801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:01,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:01,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:59:01,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090396058] [2025-01-09 03:59:01,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:01,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:59:01,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:01,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:59:01,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:59:01,706 INFO L87 Difference]: Start difference. First operand 804 states and 1176 transitions. Second operand has 8 states, 6 states have (on average 25.666666666666668) internal successors, (154), 8 states have internal predecessors, (154), 4 states have call successors, (46), 2 states have call predecessors, (46), 3 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2025-01-09 03:59:01,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:01,801 INFO L93 Difference]: Finished difference Result 1538 states and 2267 transitions. [2025-01-09 03:59:01,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:59:01,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 25.666666666666668) internal successors, (154), 8 states have internal predecessors, (154), 4 states have call successors, (46), 2 states have call predecessors, (46), 3 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) Word has length 295 [2025-01-09 03:59:01,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:01,806 INFO L225 Difference]: With dead ends: 1538 [2025-01-09 03:59:01,806 INFO L226 Difference]: Without dead ends: 806 [2025-01-09 03:59:01,808 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-01-09 03:59:01,809 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 3 mSDsluCounter, 5010 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5848 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-01-09 03:59:01,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5848 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:01,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-01-09 03:59:01,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2025-01-09 03:59:01,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 613 states have (on average 1.4796084828711256) internal successors, (907), 631 states have internal predecessors, (907), 135 states have call successors, (135), 58 states have call predecessors, (135), 57 states have return successors, (137), 126 states have call predecessors, (137), 130 states have call successors, (137) [2025-01-09 03:59:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1179 transitions. [2025-01-09 03:59:01,842 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1179 transitions. Word has length 295 [2025-01-09 03:59:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:01,842 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1179 transitions. [2025-01-09 03:59:01,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 25.666666666666668) internal successors, (154), 8 states have internal predecessors, (154), 4 states have call successors, (46), 2 states have call predecessors, (46), 3 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2025-01-09 03:59:01,843 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1179 transitions. [2025-01-09 03:59:01,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-01-09 03:59:01,847 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:01,847 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:59:01,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:59:01,847 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:01,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:01,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2027431306, now seen corresponding path program 1 times [2025-01-09 03:59:01,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:01,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050621783] [2025-01-09 03:59:01,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:01,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:01,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-01-09 03:59:01,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-01-09 03:59:01,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:01,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:02,034 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-01-09 03:59:02,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:02,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050621783] [2025-01-09 03:59:02,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050621783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:02,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:02,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:59:02,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203069200] [2025-01-09 03:59:02,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:02,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:59:02,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:02,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:59:02,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:59:02,036 INFO L87 Difference]: Start difference. First operand 806 states and 1179 transitions. Second operand has 9 states, 7 states have (on average 22.571428571428573) internal successors, (158), 8 states have internal predecessors, (158), 4 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2025-01-09 03:59:02,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:02,176 INFO L93 Difference]: Finished difference Result 1537 states and 2269 transitions. [2025-01-09 03:59:02,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:59:02,177 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 22.571428571428573) internal successors, (158), 8 states have internal predecessors, (158), 4 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) Word has length 275 [2025-01-09 03:59:02,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:02,182 INFO L225 Difference]: With dead ends: 1537 [2025-01-09 03:59:02,182 INFO L226 Difference]: Without dead ends: 808 [2025-01-09 03:59:02,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:59:02,184 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 4 mSDsluCounter, 5794 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6626 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:02,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6626 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:59:02,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-01-09 03:59:02,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2025-01-09 03:59:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 614 states have (on average 1.478827361563518) internal successors, (908), 633 states have internal predecessors, (908), 135 states have call successors, (135), 58 states have call predecessors, (135), 58 states have return successors, (142), 126 states have call predecessors, (142), 130 states have call successors, (142) [2025-01-09 03:59:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1185 transitions. [2025-01-09 03:59:02,252 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1185 transitions. Word has length 275 [2025-01-09 03:59:02,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:02,252 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1185 transitions. [2025-01-09 03:59:02,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 22.571428571428573) internal successors, (158), 8 states have internal predecessors, (158), 4 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2025-01-09 03:59:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1185 transitions. [2025-01-09 03:59:02,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-01-09 03:59:02,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:02,258 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:59:02,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:59:02,258 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:02,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:02,259 INFO L85 PathProgramCache]: Analyzing trace with hash 198947793, now seen corresponding path program 1 times [2025-01-09 03:59:02,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:02,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154783542] [2025-01-09 03:59:02,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:02,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:02,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 03:59:02,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 03:59:02,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:02,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-01-09 03:59:02,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:02,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154783542] [2025-01-09 03:59:02,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154783542] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:59:02,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319677318] [2025-01-09 03:59:02,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:02,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:59:02,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:59:02,425 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:59:02,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:59:02,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 03:59:02,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 03:59:02,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:02,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:02,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 2053 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:59:02,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:59:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2025-01-09 03:59:02,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:59:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-01-09 03:59:03,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319677318] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:59:03,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:59:03,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:59:03,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540611192] [2025-01-09 03:59:03,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:59:03,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:59:03,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:03,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:59:03,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:59:03,215 INFO L87 Difference]: Start difference. First operand 808 states and 1185 transitions. Second operand has 7 states, 7 states have (on average 31.0) internal successors, (217), 7 states have internal predecessors, (217), 2 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2025-01-09 03:59:03,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:03,390 INFO L93 Difference]: Finished difference Result 1808 states and 2725 transitions. [2025-01-09 03:59:03,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:59:03,391 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 31.0) internal successors, (217), 7 states have internal predecessors, (217), 2 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 276 [2025-01-09 03:59:03,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:03,398 INFO L225 Difference]: With dead ends: 1808 [2025-01-09 03:59:03,399 INFO L226 Difference]: Without dead ends: 1365 [2025-01-09 03:59:03,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:59:03,401 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 860 mSDsluCounter, 2220 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 3109 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:03,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 3109 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:59:03,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2025-01-09 03:59:03,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1341. [2025-01-09 03:59:03,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1068 states have (on average 1.5224719101123596) internal successors, (1626), 1087 states have internal predecessors, (1626), 214 states have call successors, (214), 58 states have call predecessors, (214), 58 states have return successors, (231), 205 states have call predecessors, (231), 209 states have call successors, (231) [2025-01-09 03:59:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 2071 transitions. [2025-01-09 03:59:03,455 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 2071 transitions. Word has length 276 [2025-01-09 03:59:03,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:03,455 INFO L471 AbstractCegarLoop]: Abstraction has 1341 states and 2071 transitions. [2025-01-09 03:59:03,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.0) internal successors, (217), 7 states have internal predecessors, (217), 2 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2025-01-09 03:59:03,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 2071 transitions. [2025-01-09 03:59:03,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-01-09 03:59:03,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:03,462 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:59:03,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:59:03,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 03:59:03,663 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:03,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:03,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2142034405, now seen corresponding path program 1 times [2025-01-09 03:59:03,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:03,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136534508] [2025-01-09 03:59:03,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:03,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:03,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-01-09 03:59:03,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-01-09 03:59:03,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:03,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-01-09 03:59:03,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:03,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136534508] [2025-01-09 03:59:03,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136534508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:03,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:03,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:59:03,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365594322] [2025-01-09 03:59:03,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:03,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:59:03,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:03,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:59:03,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:03,806 INFO L87 Difference]: Start difference. First operand 1341 states and 2071 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-01-09 03:59:03,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:03,849 INFO L93 Difference]: Finished difference Result 3051 states and 4786 transitions. [2025-01-09 03:59:03,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:59:03,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 281 [2025-01-09 03:59:03,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:03,860 INFO L225 Difference]: With dead ends: 3051 [2025-01-09 03:59:03,860 INFO L226 Difference]: Without dead ends: 1843 [2025-01-09 03:59:03,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:03,866 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 163 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:03,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1703 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:03,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2025-01-09 03:59:03,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1835. [2025-01-09 03:59:03,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1483 states have (on average 1.5340525960890088) internal successors, (2275), 1502 states have internal predecessors, (2275), 293 states have call successors, (293), 58 states have call predecessors, (293), 58 states have return successors, (320), 284 states have call predecessors, (320), 288 states have call successors, (320) [2025-01-09 03:59:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2888 transitions. [2025-01-09 03:59:03,931 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2888 transitions. Word has length 281 [2025-01-09 03:59:03,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:03,931 INFO L471 AbstractCegarLoop]: Abstraction has 1835 states and 2888 transitions. [2025-01-09 03:59:03,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-01-09 03:59:03,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2888 transitions. [2025-01-09 03:59:03,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-01-09 03:59:03,940 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:03,941 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:59:03,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:59:03,941 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:03,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:03,942 INFO L85 PathProgramCache]: Analyzing trace with hash 344922499, now seen corresponding path program 1 times [2025-01-09 03:59:03,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:03,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478468416] [2025-01-09 03:59:03,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:03,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:03,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-01-09 03:59:03,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-01-09 03:59:03,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:03,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:04,018 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-01-09 03:59:04,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:04,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478468416] [2025-01-09 03:59:04,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478468416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:04,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:04,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:59:04,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025557561] [2025-01-09 03:59:04,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:04,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:59:04,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:04,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:59:04,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:04,020 INFO L87 Difference]: Start difference. First operand 1835 states and 2888 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-01-09 03:59:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:04,078 INFO L93 Difference]: Finished difference Result 4281 states and 6810 transitions. [2025-01-09 03:59:04,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:59:04,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 282 [2025-01-09 03:59:04,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:04,092 INFO L225 Difference]: With dead ends: 4281 [2025-01-09 03:59:04,092 INFO L226 Difference]: Without dead ends: 2640 [2025-01-09 03:59:04,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:04,098 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 161 mSDsluCounter, 838 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-01-09 03:59:04,098 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-01-09 03:59:04,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2025-01-09 03:59:04,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2632. [2025-01-09 03:59:04,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2632 states, 2161 states have (on average 1.5469689958352615) internal successors, (3343), 2180 states have internal predecessors, (3343), 412 states have call successors, (412), 58 states have call predecessors, (412), 58 states have return successors, (439), 403 states have call predecessors, (439), 407 states have call successors, (439) [2025-01-09 03:59:04,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2632 states and 4194 transitions. [2025-01-09 03:59:04,179 INFO L78 Accepts]: Start accepts. Automaton has 2632 states and 4194 transitions. Word has length 282 [2025-01-09 03:59:04,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:04,183 INFO L471 AbstractCegarLoop]: Abstraction has 2632 states and 4194 transitions. [2025-01-09 03:59:04,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-01-09 03:59:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 4194 transitions. [2025-01-09 03:59:04,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-01-09 03:59:04,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:04,207 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:59:04,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:59:04,207 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:04,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:04,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1876681962, now seen corresponding path program 1 times [2025-01-09 03:59:04,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:04,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472864774] [2025-01-09 03:59:04,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:04,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:04,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-01-09 03:59:04,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-01-09 03:59:04,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:04,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:04,371 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-09 03:59:04,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:04,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472864774] [2025-01-09 03:59:04,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472864774] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:04,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:04,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:59:04,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569115012] [2025-01-09 03:59:04,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:04,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:59:04,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:04,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:59:04,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:04,373 INFO L87 Difference]: Start difference. First operand 2632 states and 4194 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-01-09 03:59:04,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:04,446 INFO L93 Difference]: Finished difference Result 6152 states and 9905 transitions. [2025-01-09 03:59:04,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:59:04,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 304 [2025-01-09 03:59:04,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:04,466 INFO L225 Difference]: With dead ends: 6152 [2025-01-09 03:59:04,466 INFO L226 Difference]: Without dead ends: 3867 [2025-01-09 03:59:04,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:04,475 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 159 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:04,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1681 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3867 states. [2025-01-09 03:59:04,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3867 to 3859. [2025-01-09 03:59:04,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3859 states, 3226 states have (on average 1.5582765034097954) internal successors, (5027), 3245 states have internal predecessors, (5027), 574 states have call successors, (574), 58 states have call predecessors, (574), 58 states have return successors, (617), 565 states have call predecessors, (617), 569 states have call successors, (617) [2025-01-09 03:59:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3859 states to 3859 states and 6218 transitions. [2025-01-09 03:59:04,595 INFO L78 Accepts]: Start accepts. Automaton has 3859 states and 6218 transitions. Word has length 304 [2025-01-09 03:59:04,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:04,595 INFO L471 AbstractCegarLoop]: Abstraction has 3859 states and 6218 transitions. [2025-01-09 03:59:04,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-01-09 03:59:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3859 states and 6218 transitions. [2025-01-09 03:59:04,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-01-09 03:59:04,611 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:04,611 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:59:04,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:59:04,612 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:04,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:04,612 INFO L85 PathProgramCache]: Analyzing trace with hash -839953541, now seen corresponding path program 1 times [2025-01-09 03:59:04,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:04,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937264312] [2025-01-09 03:59:04,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:04,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:04,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-01-09 03:59:04,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-01-09 03:59:04,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:04,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-01-09 03:59:04,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:04,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937264312] [2025-01-09 03:59:04,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937264312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:04,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:04,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:59:04,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305018704] [2025-01-09 03:59:04,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:04,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:59:04,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:04,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:59:04,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:04,684 INFO L87 Difference]: Start difference. First operand 3859 states and 6218 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-01-09 03:59:04,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:04,819 INFO L93 Difference]: Finished difference Result 9108 states and 14811 transitions. [2025-01-09 03:59:04,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:59:04,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 284 [2025-01-09 03:59:04,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:04,845 INFO L225 Difference]: With dead ends: 9108 [2025-01-09 03:59:04,845 INFO L226 Difference]: Without dead ends: 5848 [2025-01-09 03:59:04,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:04,855 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 157 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:04,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1681 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:04,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5848 states. [2025-01-09 03:59:05,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5848 to 5840. [2025-01-09 03:59:05,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5840 states, 4962 states have (on average 1.5679161628375655) internal successors, (7780), 4981 states have internal predecessors, (7780), 819 states have call successors, (819), 58 states have call predecessors, (819), 58 states have return successors, (888), 810 states have call predecessors, (888), 814 states have call successors, (888) [2025-01-09 03:59:05,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5840 states to 5840 states and 9487 transitions. [2025-01-09 03:59:05,046 INFO L78 Accepts]: Start accepts. Automaton has 5840 states and 9487 transitions. Word has length 284 [2025-01-09 03:59:05,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:05,046 INFO L471 AbstractCegarLoop]: Abstraction has 5840 states and 9487 transitions. [2025-01-09 03:59:05,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-01-09 03:59:05,047 INFO L276 IsEmpty]: Start isEmpty. Operand 5840 states and 9487 transitions. [2025-01-09 03:59:05,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-01-09 03:59:05,069 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:05,069 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:59:05,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:59:05,069 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:05,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:05,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1008759785, now seen corresponding path program 1 times [2025-01-09 03:59:05,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:05,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838053216] [2025-01-09 03:59:05,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:05,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:05,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-01-09 03:59:05,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-01-09 03:59:05,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:05,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:05,184 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-01-09 03:59:05,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:05,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838053216] [2025-01-09 03:59:05,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838053216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:05,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:05,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:59:05,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481834249] [2025-01-09 03:59:05,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:05,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:59:05,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:05,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:59:05,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:05,185 INFO L87 Difference]: Start difference. First operand 5840 states and 9487 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-01-09 03:59:05,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:05,450 INFO L93 Difference]: Finished difference Result 14024 states and 22932 transitions. [2025-01-09 03:59:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:59:05,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 285 [2025-01-09 03:59:05,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:05,500 INFO L225 Difference]: With dead ends: 14024 [2025-01-09 03:59:05,500 INFO L226 Difference]: Without dead ends: 9168 [2025-01-09 03:59:05,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:05,521 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 155 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:05,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1700 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:05,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9168 states. [2025-01-09 03:59:05,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9168 to 9160. [2025-01-09 03:59:05,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9160 states, 7789 states have (on average 1.5661830787007318) internal successors, (12199), 7808 states have internal predecessors, (12199), 1312 states have call successors, (1312), 58 states have call predecessors, (1312), 58 states have return successors, (1425), 1303 states have call predecessors, (1425), 1307 states have call successors, (1425) [2025-01-09 03:59:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9160 states to 9160 states and 14936 transitions. [2025-01-09 03:59:05,880 INFO L78 Accepts]: Start accepts. Automaton has 9160 states and 14936 transitions. Word has length 285 [2025-01-09 03:59:05,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:05,881 INFO L471 AbstractCegarLoop]: Abstraction has 9160 states and 14936 transitions. [2025-01-09 03:59:05,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-01-09 03:59:05,881 INFO L276 IsEmpty]: Start isEmpty. Operand 9160 states and 14936 transitions. [2025-01-09 03:59:05,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 03:59:05,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:05,917 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:59:05,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:59:05,917 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:05,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:05,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1259900056, now seen corresponding path program 1 times [2025-01-09 03:59:05,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:05,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281719236] [2025-01-09 03:59:05,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:05,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:05,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 03:59:05,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 03:59:05,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:05,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-09 03:59:06,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:06,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281719236] [2025-01-09 03:59:06,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281719236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:06,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:06,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:59:06,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020990162] [2025-01-09 03:59:06,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:06,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:59:06,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:06,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:59:06,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:06,043 INFO L87 Difference]: Start difference. First operand 9160 states and 14936 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-01-09 03:59:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:06,282 INFO L93 Difference]: Finished difference Result 22844 states and 37564 transitions. [2025-01-09 03:59:06,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:59:06,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 307 [2025-01-09 03:59:06,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:06,342 INFO L225 Difference]: With dead ends: 22844 [2025-01-09 03:59:06,342 INFO L226 Difference]: Without dead ends: 15148 [2025-01-09 03:59:06,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:06,378 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 153 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:06,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1688 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:06,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15148 states. [2025-01-09 03:59:06,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15148 to 15140. [2025-01-09 03:59:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15140 states, 12947 states have (on average 1.5723333590793234) internal successors, (20357), 12966 states have internal predecessors, (20357), 2134 states have call successors, (2134), 58 states have call predecessors, (2134), 58 states have return successors, (2325), 2125 states have call predecessors, (2325), 2129 states have call successors, (2325) [2025-01-09 03:59:06,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15140 states to 15140 states and 24816 transitions. [2025-01-09 03:59:06,878 INFO L78 Accepts]: Start accepts. Automaton has 15140 states and 24816 transitions. Word has length 307 [2025-01-09 03:59:06,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:06,879 INFO L471 AbstractCegarLoop]: Abstraction has 15140 states and 24816 transitions. [2025-01-09 03:59:06,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-01-09 03:59:06,879 INFO L276 IsEmpty]: Start isEmpty. Operand 15140 states and 24816 transitions. [2025-01-09 03:59:06,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 03:59:06,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:06,930 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:59:06,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:59:06,930 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:06,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:06,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1530755014, now seen corresponding path program 1 times [2025-01-09 03:59:06,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:06,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66342763] [2025-01-09 03:59:06,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:06,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:06,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 03:59:06,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 03:59:06,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:06,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-09 03:59:07,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:07,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66342763] [2025-01-09 03:59:07,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66342763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:07,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:07,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:59:07,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166662043] [2025-01-09 03:59:07,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:07,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:59:07,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:07,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:59:07,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:07,008 INFO L87 Difference]: Start difference. First operand 15140 states and 24816 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-01-09 03:59:07,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:07,552 INFO L93 Difference]: Finished difference Result 36415 states and 59429 transitions. [2025-01-09 03:59:07,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:59:07,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 308 [2025-01-09 03:59:07,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:07,635 INFO L225 Difference]: With dead ends: 36415 [2025-01-09 03:59:07,635 INFO L226 Difference]: Without dead ends: 23851 [2025-01-09 03:59:07,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:07,666 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 151 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:07,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1674 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:07,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23851 states. [2025-01-09 03:59:08,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23851 to 23843. [2025-01-09 03:59:08,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23843 states, 20447 states have (on average 1.545899153910109) internal successors, (31609), 20466 states have internal predecessors, (31609), 3337 states have call successors, (3337), 58 states have call predecessors, (3337), 58 states have return successors, (3672), 3328 states have call predecessors, (3672), 3332 states have call successors, (3672) [2025-01-09 03:59:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23843 states to 23843 states and 38618 transitions. [2025-01-09 03:59:08,745 INFO L78 Accepts]: Start accepts. Automaton has 23843 states and 38618 transitions. Word has length 308 [2025-01-09 03:59:08,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:08,746 INFO L471 AbstractCegarLoop]: Abstraction has 23843 states and 38618 transitions. [2025-01-09 03:59:08,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-01-09 03:59:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 23843 states and 38618 transitions. [2025-01-09 03:59:08,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-01-09 03:59:08,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:08,821 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:59:08,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:59:08,821 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:08,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:08,822 INFO L85 PathProgramCache]: Analyzing trace with hash 842620742, now seen corresponding path program 1 times [2025-01-09 03:59:08,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:08,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104477216] [2025-01-09 03:59:08,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:08,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:08,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-01-09 03:59:08,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-01-09 03:59:08,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:08,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:08,921 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-01-09 03:59:08,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:08,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104477216] [2025-01-09 03:59:08,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104477216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:08,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:08,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:59:08,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285207754] [2025-01-09 03:59:08,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:08,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:59:08,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:08,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:59:08,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:08,923 INFO L87 Difference]: Start difference. First operand 23843 states and 38618 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 2 states have call successors, (47), 2 states have call predecessors, (47), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-01-09 03:59:09,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:09,622 INFO L93 Difference]: Finished difference Result 62828 states and 102137 transitions. [2025-01-09 03:59:09,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:59:09,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 2 states have call successors, (47), 2 states have call predecessors, (47), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 317 [2025-01-09 03:59:09,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:09,770 INFO L225 Difference]: With dead ends: 62828 [2025-01-09 03:59:09,771 INFO L226 Difference]: Without dead ends: 42344 [2025-01-09 03:59:09,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:09,834 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 149 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:09,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1685 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:09,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42344 states. [2025-01-09 03:59:11,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42344 to 42336. [2025-01-09 03:59:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42336 states, 36490 states have (on average 1.54579336804604) internal successors, (56406), 36509 states have internal predecessors, (56406), 5787 states have call successors, (5787), 58 states have call predecessors, (5787), 58 states have return successors, (6396), 5778 states have call predecessors, (6396), 5782 states have call successors, (6396) [2025-01-09 03:59:11,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42336 states to 42336 states and 68589 transitions. [2025-01-09 03:59:11,195 INFO L78 Accepts]: Start accepts. Automaton has 42336 states and 68589 transitions. Word has length 317 [2025-01-09 03:59:11,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:11,195 INFO L471 AbstractCegarLoop]: Abstraction has 42336 states and 68589 transitions. [2025-01-09 03:59:11,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 2 states have call successors, (47), 2 states have call predecessors, (47), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-01-09 03:59:11,196 INFO L276 IsEmpty]: Start isEmpty. Operand 42336 states and 68589 transitions. [2025-01-09 03:59:11,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-01-09 03:59:11,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:11,305 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:59:11,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:59:11,305 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:11,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:11,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1012919289, now seen corresponding path program 1 times [2025-01-09 03:59:11,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:11,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088987476] [2025-01-09 03:59:11,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:11,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:11,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-01-09 03:59:11,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-01-09 03:59:11,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:11,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-09 03:59:11,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:11,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088987476] [2025-01-09 03:59:11,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088987476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:11,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:11,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:59:11,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31061033] [2025-01-09 03:59:11,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:11,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:59:11,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:11,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:59:11,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:11,386 INFO L87 Difference]: Start difference. First operand 42336 states and 68589 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-01-09 03:59:13,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:13,429 INFO L93 Difference]: Finished difference Result 114655 states and 186724 transitions. [2025-01-09 03:59:13,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:59:13,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 310 [2025-01-09 03:59:13,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:13,725 INFO L225 Difference]: With dead ends: 114655 [2025-01-09 03:59:13,726 INFO L226 Difference]: Without dead ends: 76817 [2025-01-09 03:59:13,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:13,810 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 147 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 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-01-09 03:59:13,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1684 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:13,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76817 states. [2025-01-09 03:59:15,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76817 to 76809. [2025-01-09 03:59:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76809 states, 66450 states have (on average 1.5494206170052671) internal successors, (102959), 66469 states have internal predecessors, (102959), 10300 states have call successors, (10300), 58 states have call predecessors, (10300), 58 states have return successors, (11441), 10291 states have call predecessors, (11441), 10295 states have call successors, (11441) [2025-01-09 03:59:16,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76809 states to 76809 states and 124700 transitions. [2025-01-09 03:59:16,558 INFO L78 Accepts]: Start accepts. Automaton has 76809 states and 124700 transitions. Word has length 310 [2025-01-09 03:59:16,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:16,559 INFO L471 AbstractCegarLoop]: Abstraction has 76809 states and 124700 transitions. [2025-01-09 03:59:16,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-01-09 03:59:16,559 INFO L276 IsEmpty]: Start isEmpty. Operand 76809 states and 124700 transitions. [2025-01-09 03:59:16,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-01-09 03:59:16,743 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:16,743 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:59:16,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 03:59:16,744 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:16,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:16,744 INFO L85 PathProgramCache]: Analyzing trace with hash -552699646, now seen corresponding path program 1 times [2025-01-09 03:59:16,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:16,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101436302] [2025-01-09 03:59:16,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:16,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:16,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-01-09 03:59:16,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-01-09 03:59:16,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:16,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-01-09 03:59:16,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:16,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101436302] [2025-01-09 03:59:16,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101436302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:16,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:16,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:59:16,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288274280] [2025-01-09 03:59:16,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:16,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:59:16,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:16,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:59:16,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:16,813 INFO L87 Difference]: Start difference. First operand 76809 states and 124700 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-01-09 03:59:19,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:19,811 INFO L93 Difference]: Finished difference Result 143597 states and 233897 transitions. [2025-01-09 03:59:19,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:59:19,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 290 [2025-01-09 03:59:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:21,019 INFO L225 Difference]: With dead ends: 143597 [2025-01-09 03:59:21,019 INFO L226 Difference]: Without dead ends: 143154 [2025-01-09 03:59:21,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:21,117 INFO L435 NwaCegarLoop]: 848 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, 1692 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:21,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1692 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:21,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143154 states. [2025-01-09 03:59:24,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143154 to 143146. [2025-01-09 03:59:24,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143146 states, 124419 states have (on average 1.548413023734317) internal successors, (192652), 124438 states have internal predecessors, (192652), 18668 states have call successors, (18668), 58 states have call predecessors, (18668), 58 states have return successors, (20855), 18659 states have call predecessors, (20855), 18663 states have call successors, (20855) [2025-01-09 03:59:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143146 states to 143146 states and 232175 transitions. [2025-01-09 03:59:25,354 INFO L78 Accepts]: Start accepts. Automaton has 143146 states and 232175 transitions. Word has length 290 [2025-01-09 03:59:25,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:25,354 INFO L471 AbstractCegarLoop]: Abstraction has 143146 states and 232175 transitions. [2025-01-09 03:59:25,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-01-09 03:59:25,355 INFO L276 IsEmpty]: Start isEmpty. Operand 143146 states and 232175 transitions. [2025-01-09 03:59:25,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-01-09 03:59:25,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:25,749 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:59:25,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 03:59:25,750 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:25,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:25,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1551553993, now seen corresponding path program 1 times [2025-01-09 03:59:25,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:25,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504952643] [2025-01-09 03:59:25,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:25,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:25,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-01-09 03:59:25,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-01-09 03:59:25,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:25,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:26,849 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-01-09 03:59:26,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:26,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504952643] [2025-01-09 03:59:26,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504952643] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:59:26,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161710995] [2025-01-09 03:59:26,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:26,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:59:26,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:59:26,853 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:59:26,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:59:27,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-01-09 03:59:27,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-01-09 03:59:27,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:27,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:27,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 2103 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 03:59:27,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:59:28,051 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 03:59:28,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:59:29,739 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-01-09 03:59:29,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161710995] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:59:29,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:59:29,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 44 [2025-01-09 03:59:29,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481028847] [2025-01-09 03:59:29,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:59:29,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-09 03:59:29,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:29,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-09 03:59:29,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1697, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 03:59:29,743 INFO L87 Difference]: Start difference. First operand 143146 states and 232175 transitions. Second operand has 44 states, 38 states have (on average 11.18421052631579) internal successors, (425), 41 states have internal predecessors, (425), 23 states have call successors, (103), 7 states have call predecessors, (103), 19 states have return successors, (99), 23 states have call predecessors, (99), 23 states have call successors, (99) [2025-01-09 03:59:45,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:45,496 INFO L93 Difference]: Finished difference Result 286000 states and 469265 transitions. [2025-01-09 03:59:45,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-01-09 03:59:45,496 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 38 states have (on average 11.18421052631579) internal successors, (425), 41 states have internal predecessors, (425), 23 states have call successors, (103), 7 states have call predecessors, (103), 19 states have return successors, (99), 23 states have call predecessors, (99), 23 states have call successors, (99) Word has length 291 [2025-01-09 03:59:45,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:47,189 INFO L225 Difference]: With dead ends: 286000 [2025-01-09 03:59:47,189 INFO L226 Difference]: Without dead ends: 285664 [2025-01-09 03:59:47,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 573 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1842 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=979, Invalid=7951, Unknown=0, NotChecked=0, Total=8930 [2025-01-09 03:59:47,285 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 6906 mSDsluCounter, 11963 mSDsCounter, 0 mSdLazyCounter, 18807 mSolverCounterSat, 2794 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6971 SdHoareTripleChecker+Valid, 12555 SdHoareTripleChecker+Invalid, 21601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2794 IncrementalHoareTripleChecker+Valid, 18807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:47,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6971 Valid, 12555 Invalid, 21601 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2794 Valid, 18807 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2025-01-09 03:59:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285664 states. [2025-01-09 03:59:57,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285664 to 285437. [2025-01-09 03:59:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285437 states, 248039 states have (on average 1.548736287438669) internal successors, (384147), 247999 states have internal predecessors, (384147), 37191 states have call successors, (37191), 178 states have call predecessors, (37191), 206 states have return successors, (44956), 37306 states have call predecessors, (44956), 37181 states have call successors, (44956) [2025-01-09 03:59:59,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285437 states to 285437 states and 466294 transitions. [2025-01-09 04:00:00,175 INFO L78 Accepts]: Start accepts. Automaton has 285437 states and 466294 transitions. Word has length 291 [2025-01-09 04:00:00,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:00,182 INFO L471 AbstractCegarLoop]: Abstraction has 285437 states and 466294 transitions. [2025-01-09 04:00:00,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 38 states have (on average 11.18421052631579) internal successors, (425), 41 states have internal predecessors, (425), 23 states have call successors, (103), 7 states have call predecessors, (103), 19 states have return successors, (99), 23 states have call predecessors, (99), 23 states have call successors, (99) [2025-01-09 04:00:00,182 INFO L276 IsEmpty]: Start isEmpty. Operand 285437 states and 466294 transitions. [2025-01-09 04:00:01,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-01-09 04:00:01,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:01,686 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:01,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 04:00:01,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-09 04:00:01,887 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:01,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:01,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1781905969, now seen corresponding path program 1 times [2025-01-09 04:00:01,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:01,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544356697] [2025-01-09 04:00:01,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:01,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:01,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 04:00:01,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 04:00:01,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:01,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-09 04:00:02,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:02,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544356697] [2025-01-09 04:00:02,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544356697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:02,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:02,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:00:02,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836873420] [2025-01-09 04:00:02,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:02,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:00:02,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:02,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:00:02,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:00:02,095 INFO L87 Difference]: Start difference. First operand 285437 states and 466294 transitions. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 5 states have internal predecessors, (169), 3 states have call successors, (46), 3 states have call predecessors, (46), 2 states have return successors, (41), 4 states have call predecessors, (41), 3 states have call successors, (41)