./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec4_productSimulator.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec4_productSimulator.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cf397912a53dab4d44f4df9c274fc7c69b1023a0a0a29a356bc73a744537daa6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:34:38,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:34:38,735 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:34:38,741 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:34:38,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:34:38,761 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:34:38,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:34:38,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:34:38,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:34:38,763 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:34:38,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:34:38,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:34:38,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:34:38,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:34:38,764 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:34:38,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:34:38,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:34:38,764 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:34:38,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:34:38,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:34:38,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:34:38,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:34:38,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:34:38,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:34:38,764 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:34:38,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:34:38,764 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:34:38,765 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:34:38,765 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:34:38,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:34:38,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:34:38,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:34:38,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:34:38,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:34:38,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:34:38,765 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:34:38,765 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:34:38,765 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:34:38,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:34:38,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:34:38,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:34:38,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:34:38,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:34:38,765 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cf397912a53dab4d44f4df9c274fc7c69b1023a0a0a29a356bc73a744537daa6 [2025-03-08 05:34:38,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:34:38,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:34:38,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:34:38,994 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:34:38,994 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:34:38,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec4_productSimulator.cil.c [2025-03-08 05:34:40,154 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc3e279f/884a616b85d746e78211eb86adfed539/FLAG6d5381332 [2025-03-08 05:34:40,529 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:34:40,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_productSimulator.cil.c [2025-03-08 05:34:40,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc3e279f/884a616b85d746e78211eb86adfed539/FLAG6d5381332 [2025-03-08 05:34:40,749 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc3e279f/884a616b85d746e78211eb86adfed539 [2025-03-08 05:34:40,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:34:40,752 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:34:40,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:34:40,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:34:40,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:34:40,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:34:40" (1/1) ... [2025-03-08 05:34:40,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294ee212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:40, skipping insertion in model container [2025-03-08 05:34:40,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:34:40" (1/1) ... [2025-03-08 05:34:40,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:34:41,070 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_productSimulator.cil.c[18883,18896] [2025-03-08 05:34:41,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:34:41,238 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:34:41,244 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-03-08 05:34:41,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [335] [2025-03-08 05:34:41,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [353] [2025-03-08 05:34:41,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [938] [2025-03-08 05:34:41,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [947] [2025-03-08 05:34:41,247 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2018] [2025-03-08 05:34:41,247 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2128] [2025-03-08 05:34:41,247 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2527] [2025-03-08 05:34:41,248 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2876] [2025-03-08 05:34:41,248 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3080] [2025-03-08 05:34:41,248 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [3446] [2025-03-08 05:34:41,285 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_productSimulator.cil.c[18883,18896] [2025-03-08 05:34:41,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:34:41,393 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:34:41,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:41 WrapperNode [2025-03-08 05:34:41,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:34:41,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:34:41,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:34:41,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:34:41,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:41" (1/1) ... [2025-03-08 05:34:41,427 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:41" (1/1) ... [2025-03-08 05:34:41,470 INFO L138 Inliner]: procedures = 151, calls = 263, calls flagged for inlining = 67, calls inlined = 64, statements flattened = 1314 [2025-03-08 05:34:41,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:34:41,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:34:41,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:34:41,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:34:41,478 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:41" (1/1) ... [2025-03-08 05:34:41,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:41" (1/1) ... [2025-03-08 05:34:41,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:41" (1/1) ... [2025-03-08 05:34:41,519 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-08 05:34:41,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:41" (1/1) ... [2025-03-08 05:34:41,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:41" (1/1) ... [2025-03-08 05:34:41,537 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:41" (1/1) ... [2025-03-08 05:34:41,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:41" (1/1) ... [2025-03-08 05:34:41,543 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:41" (1/1) ... [2025-03-08 05:34:41,545 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:41" (1/1) ... [2025-03-08 05:34:41,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:34:41,551 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:34:41,551 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:34:41,551 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:34:41,552 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:41" (1/1) ... [2025-03-08 05:34:41,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:34:41,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:41,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:34:41,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:34:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-08 05:34:41,597 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-08 05:34:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-03-08 05:34:41,597 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-03-08 05:34:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-03-08 05:34:41,597 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-03-08 05:34:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-08 05:34:41,597 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-08 05:34:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:34:41,597 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:34:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-08 05:34:41,597 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-08 05:34:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:34:41,597 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:34:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-03-08 05:34:41,597 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-03-08 05:34:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:34:41,597 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:34:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-03-08 05:34:41,597 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-03-08 05:34:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:34:41,597 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:34:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:34:41,597 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:34:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:34:41,598 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:34:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-03-08 05:34:41,598 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-03-08 05:34:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-03-08 05:34:41,598 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-03-08 05:34:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:34:41,598 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:34:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:34:41,598 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:34:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:34:41,598 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:34:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-03-08 05:34:41,598 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-03-08 05:34:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:34:41,598 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:34:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-08 05:34:41,598 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-08 05:34:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:34:41,599 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:34:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-03-08 05:34:41,599 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-03-08 05:34:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:34:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:34:41,599 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:34:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-08 05:34:41,599 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-08 05:34:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-03-08 05:34:41,599 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-03-08 05:34:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-03-08 05:34:41,599 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-03-08 05:34:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-03-08 05:34:41,599 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-03-08 05:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-08 05:34:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-08 05:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:34:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:34:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:34:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-08 05:34:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-08 05:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:34:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:34:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-03-08 05:34:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-03-08 05:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-03-08 05:34:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-03-08 05:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:34:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:34:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:34:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-03-08 05:34:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-03-08 05:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-03-08 05:34:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-03-08 05:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-08 05:34:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-08 05:34:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:34:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:34:41,774 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:34:41,778 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:34:41,839 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3015: #res := ~retValue_acc~37; [2025-03-08 05:34:41,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2434: #res := ~retValue_acc~33; [2025-03-08 05:34:41,869 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L822: #res := ~retValue_acc~5; [2025-03-08 05:34:41,884 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1560: #res := ~retValue_acc~15; [2025-03-08 05:34:41,944 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1104: #res := ~retValue_acc~9; [2025-03-08 05:34:41,977 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2171-1: getEmailId_#res#1 := getEmailId_~retValue_acc~26#1; [2025-03-08 05:34:42,003 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2397: #res := ~retValue_acc~32; [2025-03-08 05:34:42,033 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2245: #res := ~retValue_acc~28; [2025-03-08 05:34:42,074 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3035-1: isReadable__role__Encrypt_#res#1 := isReadable__role__Encrypt_~retValue_acc~38#1; [2025-03-08 05:34:42,075 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3053: #res#1 := ~retValue_acc~39#1; [2025-03-08 05:34:42,142 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1652: #res#1 := ~retValue_acc~17#1; [2025-03-08 05:34:42,142 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1607-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~16#1; [2025-03-08 05:34:42,178 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1876: #res := ~retValue_acc~20; [2025-03-08 05:34:42,186 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3077-1: createEmail_#res#1 := createEmail_~retValue_acc~41#1; [2025-03-08 05:34:42,192 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2360: #res := ~retValue_acc~31; [2025-03-08 05:34:42,237 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1995-1: getClientId_#res#1 := getClientId_~retValue_acc~22#1; [2025-03-08 05:34:42,268 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1948-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~21#1; [2025-03-08 05:34:42,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2508-1: isVerified_#res#1 := isVerified_~retValue_acc~35#1; [2025-03-08 05:34:42,277 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2471: #res := ~retValue_acc~34; [2025-03-08 05:34:42,310 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2030: #res := ~retValue_acc~23; [2025-03-08 05:34:42,331 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1430: #res := ~retValue_acc~13; [2025-03-08 05:34:42,349 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1513-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~14#1; [2025-03-08 05:34:42,622 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L779-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~2#1; [2025-03-08 05:34:42,622 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L797-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~4#1; [2025-03-08 05:34:42,622 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~19#1; [2025-03-08 05:34:42,622 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2125-1: valid_product_#res#1 := valid_product_~retValue_acc~24#1; [2025-03-08 05:34:42,622 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L788-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~3#1; [2025-03-08 05:34:42,622 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1715-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~18#1; [2025-03-08 05:34:42,627 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2208: #res := ~retValue_acc~27; [2025-03-08 05:34:42,788 INFO L? ?]: Removed 627 outVars from TransFormulas that were not future-live. [2025-03-08 05:34:42,788 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:34:42,811 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:34:42,812 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:34:42,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:34:42 BoogieIcfgContainer [2025-03-08 05:34:42,813 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:34:42,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:34:42,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:34:42,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:34:42,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:34:40" (1/3) ... [2025-03-08 05:34:42,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e94f467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:34:42, skipping insertion in model container [2025-03-08 05:34:42,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:41" (2/3) ... [2025-03-08 05:34:42,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e94f467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:34:42, skipping insertion in model container [2025-03-08 05:34:42,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:34:42" (3/3) ... [2025-03-08 05:34:42,822 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec4_productSimulator.cil.c [2025-03-08 05:34:42,835 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:34:42,837 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec4_productSimulator.cil.c that has 44 procedures, 601 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:34:42,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:34:42,922 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;@6cc518a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:34:42,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:34:42,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 601 states, 446 states have (on average 1.515695067264574) internal successors, (676), 466 states have internal predecessors, (676), 110 states have call successors, (110), 43 states have call predecessors, (110), 43 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-08 05:34:42,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 05:34:42,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:42,942 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] [2025-03-08 05:34:42,942 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:42,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:42,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1439800966, now seen corresponding path program 1 times [2025-03-08 05:34:42,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:42,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484094685] [2025-03-08 05:34:42,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:42,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:43,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 05:34:43,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 05:34:43,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:43,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:43,243 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 05:34:43,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:43,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484094685] [2025-03-08 05:34:43,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484094685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:43,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:43,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 05:34:43,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800478645] [2025-03-08 05:34:43,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:43,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 05:34:43,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:43,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 05:34:43,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:34:43,265 INFO L87 Difference]: Start difference. First operand has 601 states, 446 states have (on average 1.515695067264574) internal successors, (676), 466 states have internal predecessors, (676), 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 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:34:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:43,331 INFO L93 Difference]: Finished difference Result 935 states and 1374 transitions. [2025-03-08 05:34:43,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 05:34:43,333 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 133 [2025-03-08 05:34:43,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:43,350 INFO L225 Difference]: With dead ends: 935 [2025-03-08 05:34:43,351 INFO L226 Difference]: Without dead ends: 594 [2025-03-08 05:34:43,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:34:43,360 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:43,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:43,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-08 05:34:43,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2025-03-08 05:34:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 440 states have (on average 1.5136363636363637) internal successors, (666), 459 states have internal predecessors, (666), 110 states have call successors, (110), 43 states have call predecessors, (110), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-03-08 05:34:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 885 transitions. [2025-03-08 05:34:43,431 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 885 transitions. Word has length 133 [2025-03-08 05:34:43,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:43,433 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 885 transitions. [2025-03-08 05:34:43,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:34:43,434 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 885 transitions. [2025-03-08 05:34:43,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 05:34:43,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:43,442 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] [2025-03-08 05:34:43,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:34:43,442 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:43,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:43,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1920881224, now seen corresponding path program 1 times [2025-03-08 05:34:43,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:43,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441902111] [2025-03-08 05:34:43,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:43,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:43,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 05:34:43,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 05:34:43,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:43,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 05:34:43,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:43,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441902111] [2025-03-08 05:34:43,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441902111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:43,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:43,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:34:43,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591941749] [2025-03-08 05:34:43,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:43,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:34:43,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:43,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:34:43,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:34:43,846 INFO L87 Difference]: Start difference. First operand 594 states and 885 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:34:43,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:43,944 INFO L93 Difference]: Finished difference Result 1152 states and 1714 transitions. [2025-03-08 05:34:43,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:34:43,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 133 [2025-03-08 05:34:43,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:43,952 INFO L225 Difference]: With dead ends: 1152 [2025-03-08 05:34:43,953 INFO L226 Difference]: Without dead ends: 594 [2025-03-08 05:34:43,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:34:43,957 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 0 mSDsluCounter, 2637 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3520 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:43,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3520 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:43,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-08 05:34:43,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2025-03-08 05:34:43,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 440 states have (on average 1.4977272727272728) internal successors, (659), 459 states have internal predecessors, (659), 110 states have call successors, (110), 43 states have call predecessors, (110), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-03-08 05:34:43,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 878 transitions. [2025-03-08 05:34:43,999 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 878 transitions. Word has length 133 [2025-03-08 05:34:43,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:43,999 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 878 transitions. [2025-03-08 05:34:43,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:34:44,000 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 878 transitions. [2025-03-08 05:34:44,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 05:34:44,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:44,003 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] [2025-03-08 05:34:44,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:34:44,003 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:44,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:44,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1941586599, now seen corresponding path program 1 times [2025-03-08 05:34:44,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:44,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943114615] [2025-03-08 05:34:44,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:44,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:44,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 05:34:44,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 05:34:44,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:44,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:44,141 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 05:34:44,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:44,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943114615] [2025-03-08 05:34:44,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943114615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:44,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:44,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:44,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776339127] [2025-03-08 05:34:44,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:44,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:44,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:44,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:44,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:44,143 INFO L87 Difference]: Start difference. First operand 594 states and 878 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 05:34:44,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:44,204 INFO L93 Difference]: Finished difference Result 1158 states and 1727 transitions. [2025-03-08 05:34:44,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:44,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 138 [2025-03-08 05:34:44,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:44,214 INFO L225 Difference]: With dead ends: 1158 [2025-03-08 05:34:44,214 INFO L226 Difference]: Without dead ends: 595 [2025-03-08 05:34:44,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:44,221 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 842 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:44,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 885 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:44,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-08 05:34:44,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2025-03-08 05:34:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 442 states have (on average 1.4864253393665159) internal successors, (657), 459 states have internal predecessors, (657), 108 states have call successors, (108), 44 states have call predecessors, (108), 44 states have return successors, (107), 106 states have call predecessors, (107), 107 states have call successors, (107) [2025-03-08 05:34:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 872 transitions. [2025-03-08 05:34:44,259 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 872 transitions. Word has length 138 [2025-03-08 05:34:44,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:44,260 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 872 transitions. [2025-03-08 05:34:44,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 05:34:44,260 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 872 transitions. [2025-03-08 05:34:44,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 05:34:44,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:44,265 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:44,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:34:44,265 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:44,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:44,266 INFO L85 PathProgramCache]: Analyzing trace with hash 742390728, now seen corresponding path program 1 times [2025-03-08 05:34:44,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:44,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069940994] [2025-03-08 05:34:44,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:44,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:44,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 05:34:44,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 05:34:44,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:44,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:44,387 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 05:34:44,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:44,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069940994] [2025-03-08 05:34:44,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069940994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:44,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:44,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:44,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968626712] [2025-03-08 05:34:44,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:44,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:44,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:44,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:44,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:44,390 INFO L87 Difference]: Start difference. First operand 595 states and 872 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:34:44,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:44,442 INFO L93 Difference]: Finished difference Result 1152 states and 1706 transitions. [2025-03-08 05:34:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:44,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-03-08 05:34:44,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:44,447 INFO L225 Difference]: With dead ends: 1152 [2025-03-08 05:34:44,447 INFO L226 Difference]: Without dead ends: 593 [2025-03-08 05:34:44,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:44,451 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 822 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:44,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 898 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:44,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-08 05:34:44,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2025-03-08 05:34:44,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 442 states have (on average 1.4796380090497738) internal successors, (654), 457 states have internal predecessors, (654), 106 states have call successors, (106), 44 states have call predecessors, (106), 44 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 05:34:44,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 865 transitions. [2025-03-08 05:34:44,511 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 865 transitions. Word has length 148 [2025-03-08 05:34:44,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:44,512 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 865 transitions. [2025-03-08 05:34:44,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:34:44,512 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 865 transitions. [2025-03-08 05:34:44,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 05:34:44,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:44,517 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:44,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:34:44,517 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:44,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash 985182484, now seen corresponding path program 1 times [2025-03-08 05:34:44,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:44,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831548710] [2025-03-08 05:34:44,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:44,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:44,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 05:34:44,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 05:34:44,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:44,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 05:34:44,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:44,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831548710] [2025-03-08 05:34:44,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831548710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:44,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:44,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:44,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668870276] [2025-03-08 05:34:44,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:44,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:44,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:44,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:44,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:44,636 INFO L87 Difference]: Start difference. First operand 593 states and 865 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:34:44,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:44,707 INFO L93 Difference]: Finished difference Result 1143 states and 1672 transitions. [2025-03-08 05:34:44,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:44,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 149 [2025-03-08 05:34:44,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:44,714 INFO L225 Difference]: With dead ends: 1143 [2025-03-08 05:34:44,714 INFO L226 Difference]: Without dead ends: 596 [2025-03-08 05:34:44,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:44,717 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 802 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:44,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 881 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:44,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-08 05:34:44,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 590. [2025-03-08 05:34:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 442 states have (on average 1.4547511312217194) internal successors, (643), 452 states have internal predecessors, (643), 103 states have call successors, (103), 44 states have call predecessors, (103), 44 states have return successors, (102), 101 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 05:34:44,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 848 transitions. [2025-03-08 05:34:44,759 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 848 transitions. Word has length 149 [2025-03-08 05:34:44,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:44,759 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 848 transitions. [2025-03-08 05:34:44,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:34:44,759 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 848 transitions. [2025-03-08 05:34:44,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 05:34:44,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:44,763 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:44,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:34:44,763 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:44,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:44,763 INFO L85 PathProgramCache]: Analyzing trace with hash -2063878935, now seen corresponding path program 1 times [2025-03-08 05:34:44,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:44,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710394910] [2025-03-08 05:34:44,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:44,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:44,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 05:34:44,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 05:34:44,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:44,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:45,052 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-08 05:34:45,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:45,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710394910] [2025-03-08 05:34:45,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710394910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:45,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633264456] [2025-03-08 05:34:45,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:45,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:45,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:45,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:45,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:34:45,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 05:34:45,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 05:34:45,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:45,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:45,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:34:45,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:45,408 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-08 05:34:45,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:34:45,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633264456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:45,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:34:45,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-08 05:34:45,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746536463] [2025-03-08 05:34:45,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:45,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:45,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:45,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:45,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:34:45,410 INFO L87 Difference]: Start difference. First operand 590 states and 848 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:34:45,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:45,444 INFO L93 Difference]: Finished difference Result 915 states and 1297 transitions. [2025-03-08 05:34:45,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:45,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 167 [2025-03-08 05:34:45,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:45,448 INFO L225 Difference]: With dead ends: 915 [2025-03-08 05:34:45,448 INFO L226 Difference]: Without dead ends: 591 [2025-03-08 05:34:45,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:34:45,450 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 0 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:45,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1688 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:45,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-08 05:34:45,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-03-08 05:34:45,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 443 states have (on average 1.4537246049661399) internal successors, (644), 453 states have internal predecessors, (644), 103 states have call successors, (103), 44 states have call predecessors, (103), 44 states have return successors, (102), 101 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 05:34:45,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 849 transitions. [2025-03-08 05:34:45,478 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 849 transitions. Word has length 167 [2025-03-08 05:34:45,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:45,479 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 849 transitions. [2025-03-08 05:34:45,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:34:45,480 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 849 transitions. [2025-03-08 05:34:45,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-08 05:34:45,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:45,481 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:45,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:34:45,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 05:34:45,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:45,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:45,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1272994314, now seen corresponding path program 1 times [2025-03-08 05:34:45,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:45,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368239907] [2025-03-08 05:34:45,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:45,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:45,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 05:34:45,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 05:34:45,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:45,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:45,976 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-08 05:34:45,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:45,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368239907] [2025-03-08 05:34:45,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368239907] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:45,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041446562] [2025-03-08 05:34:45,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:45,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:45,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:45,978 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:45,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:34:46,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 05:34:46,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 05:34:46,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:46,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:46,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:34:46,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-08 05:34:46,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:34:46,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041446562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:46,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:34:46,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-08 05:34:46,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860116893] [2025-03-08 05:34:46,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:46,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:46,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:46,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:46,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:34:46,305 INFO L87 Difference]: Start difference. First operand 591 states and 849 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:34:46,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:46,341 INFO L93 Difference]: Finished difference Result 1201 states and 1758 transitions. [2025-03-08 05:34:46,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:46,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 173 [2025-03-08 05:34:46,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:46,347 INFO L225 Difference]: With dead ends: 1201 [2025-03-08 05:34:46,347 INFO L226 Difference]: Without dead ends: 687 [2025-03-08 05:34:46,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:34:46,350 INFO L435 NwaCegarLoop]: 861 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, 1659 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:46,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1659 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:46,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-03-08 05:34:46,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 679. [2025-03-08 05:34:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 517 states have (on average 1.4700193423597678) internal successors, (760), 527 states have internal predecessors, (760), 117 states have call successors, (117), 44 states have call predecessors, (117), 44 states have return successors, (116), 115 states have call predecessors, (116), 116 states have call successors, (116) [2025-03-08 05:34:46,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 993 transitions. [2025-03-08 05:34:46,384 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 993 transitions. Word has length 173 [2025-03-08 05:34:46,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:46,385 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 993 transitions. [2025-03-08 05:34:46,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:34:46,385 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 993 transitions. [2025-03-08 05:34:46,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-08 05:34:46,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:46,388 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:46,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:34:46,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-08 05:34:46,592 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:46,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:46,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1083936419, now seen corresponding path program 1 times [2025-03-08 05:34:46,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:46,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516208001] [2025-03-08 05:34:46,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:46,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:46,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 05:34:46,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 05:34:46,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:46,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-08 05:34:46,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:46,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516208001] [2025-03-08 05:34:46,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516208001] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:46,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297974875] [2025-03-08 05:34:46,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:46,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:46,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:46,828 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:46,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:34:47,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 05:34:47,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 05:34:47,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:47,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:47,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 1374 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 05:34:47,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-08 05:34:47,255 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:34:47,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297974875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:47,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:34:47,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-08 05:34:47,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922641979] [2025-03-08 05:34:47,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:47,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:34:47,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:47,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:34:47,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:34:47,257 INFO L87 Difference]: Start difference. First operand 679 states and 993 transitions. Second operand has 8 states, 6 states have (on average 16.666666666666668) internal successors, (100), 8 states have internal predecessors, (100), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 05:34:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:47,385 INFO L93 Difference]: Finished difference Result 1305 states and 1923 transitions. [2025-03-08 05:34:47,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:34:47,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 16.666666666666668) internal successors, (100), 8 states have internal predecessors, (100), 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 174 [2025-03-08 05:34:47,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:47,390 INFO L225 Difference]: With dead ends: 1305 [2025-03-08 05:34:47,390 INFO L226 Difference]: Without dead ends: 681 [2025-03-08 05:34:47,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:34:47,392 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 4 mSDsluCounter, 4993 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5828 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:47,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5828 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:47,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-08 05:34:47,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2025-03-08 05:34:47,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 518 states have (on average 1.4691119691119692) internal successors, (761), 529 states have internal predecessors, (761), 117 states have call successors, (117), 44 states have call predecessors, (117), 45 states have return successors, (118), 115 states have call predecessors, (118), 116 states have call successors, (118) [2025-03-08 05:34:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 996 transitions. [2025-03-08 05:34:47,424 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 996 transitions. Word has length 174 [2025-03-08 05:34:47,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:47,424 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 996 transitions. [2025-03-08 05:34:47,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 16.666666666666668) internal successors, (100), 8 states have internal predecessors, (100), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 05:34:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 996 transitions. [2025-03-08 05:34:47,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 05:34:47,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:47,427 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:47,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:34:47,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:47,628 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:47,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:47,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2124886053, now seen corresponding path program 1 times [2025-03-08 05:34:47,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:47,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409740102] [2025-03-08 05:34:47,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:47,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:47,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 05:34:47,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 05:34:47,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:47,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 05:34:47,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:47,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409740102] [2025-03-08 05:34:47,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409740102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:47,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465810552] [2025-03-08 05:34:47,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:47,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:47,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:47,804 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:47,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:34:47,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 05:34:48,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 05:34:48,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:48,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:48,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 1375 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:34:48,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:48,162 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-08 05:34:48,162 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:34:48,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465810552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:48,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:34:48,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-08 05:34:48,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702063402] [2025-03-08 05:34:48,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:48,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:34:48,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:48,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:34:48,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:34:48,163 INFO L87 Difference]: Start difference. First operand 681 states and 996 transitions. Second operand has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 05:34:48,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:48,252 INFO L93 Difference]: Finished difference Result 1306 states and 1927 transitions. [2025-03-08 05:34:48,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:34:48,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 175 [2025-03-08 05:34:48,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:48,257 INFO L225 Difference]: With dead ends: 1306 [2025-03-08 05:34:48,257 INFO L226 Difference]: Without dead ends: 683 [2025-03-08 05:34:48,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:34:48,261 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 2 mSDsluCounter, 3323 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4158 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:48,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4158 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:48,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-03-08 05:34:48,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2025-03-08 05:34:48,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 519 states have (on average 1.4682080924855492) internal successors, (762), 531 states have internal predecessors, (762), 117 states have call successors, (117), 44 states have call predecessors, (117), 46 states have return successors, (123), 115 states have call predecessors, (123), 116 states have call successors, (123) [2025-03-08 05:34:48,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1002 transitions. [2025-03-08 05:34:48,296 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1002 transitions. Word has length 175 [2025-03-08 05:34:48,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:48,298 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 1002 transitions. [2025-03-08 05:34:48,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 05:34:48,298 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1002 transitions. [2025-03-08 05:34:48,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 05:34:48,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:48,301 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:48,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:34:48,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:48,502 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:48,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:48,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1537516716, now seen corresponding path program 1 times [2025-03-08 05:34:48,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:48,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281924276] [2025-03-08 05:34:48,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:48,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:48,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 05:34:48,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 05:34:48,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:48,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:48,682 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-08 05:34:48,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:48,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281924276] [2025-03-08 05:34:48,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281924276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:48,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:48,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:34:48,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744734422] [2025-03-08 05:34:48,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:48,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:34:48,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:48,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:34:48,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:34:48,684 INFO L87 Difference]: Start difference. First operand 683 states and 1002 transitions. Second operand has 8 states, 6 states have (on average 16.333333333333332) internal successors, (98), 8 states have internal predecessors, (98), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 05:34:48,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:48,789 INFO L93 Difference]: Finished difference Result 1294 states and 1914 transitions. [2025-03-08 05:34:48,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:34:48,789 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 16.333333333333332) internal successors, (98), 8 states have internal predecessors, (98), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 176 [2025-03-08 05:34:48,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:48,794 INFO L225 Difference]: With dead ends: 1294 [2025-03-08 05:34:48,794 INFO L226 Difference]: Without dead ends: 683 [2025-03-08 05:34:48,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:34:48,796 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 4 mSDsluCounter, 4999 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5835 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:48,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5835 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:34:48,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-03-08 05:34:48,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2025-03-08 05:34:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 519 states have (on average 1.4682080924855492) internal successors, (762), 531 states have internal predecessors, (762), 117 states have call successors, (117), 44 states have call predecessors, (117), 46 states have return successors, (122), 115 states have call predecessors, (122), 116 states have call successors, (122) [2025-03-08 05:34:48,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1001 transitions. [2025-03-08 05:34:48,845 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1001 transitions. Word has length 176 [2025-03-08 05:34:48,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:48,845 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 1001 transitions. [2025-03-08 05:34:48,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 16.333333333333332) internal successors, (98), 8 states have internal predecessors, (98), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 05:34:48,846 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1001 transitions. [2025-03-08 05:34:48,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 05:34:48,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:48,849 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:48,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:34:48,849 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:48,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:48,850 INFO L85 PathProgramCache]: Analyzing trace with hash -534247296, now seen corresponding path program 2 times [2025-03-08 05:34:48,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:48,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897450219] [2025-03-08 05:34:48,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:34:48,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:48,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 177 statements into 2 equivalence classes. [2025-03-08 05:34:48,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 66 of 177 statements. [2025-03-08 05:34:48,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:34:48,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-08 05:34:49,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:49,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897450219] [2025-03-08 05:34:49,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897450219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:49,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:49,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:34:49,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140126786] [2025-03-08 05:34:49,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:49,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:34:49,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:49,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:34:49,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:34:49,021 INFO L87 Difference]: Start difference. First operand 683 states and 1001 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:34:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:49,515 INFO L93 Difference]: Finished difference Result 1336 states and 1978 transitions. [2025-03-08 05:34:49,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:34:49,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) Word has length 177 [2025-03-08 05:34:49,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:49,524 INFO L225 Difference]: With dead ends: 1336 [2025-03-08 05:34:49,524 INFO L226 Difference]: Without dead ends: 1332 [2025-03-08 05:34:49,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:34:49,526 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 1335 mSDsluCounter, 4082 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 4945 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:49,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1337 Valid, 4945 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:34:49,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2025-03-08 05:34:49,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1321. [2025-03-08 05:34:49,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1008 states have (on average 1.4811507936507937) internal successors, (1493), 1029 states have internal predecessors, (1493), 223 states have call successors, (223), 86 states have call predecessors, (223), 89 states have return successors, (238), 221 states have call predecessors, (238), 221 states have call successors, (238) [2025-03-08 05:34:49,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1954 transitions. [2025-03-08 05:34:49,588 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1954 transitions. Word has length 177 [2025-03-08 05:34:49,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:49,589 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1954 transitions. [2025-03-08 05:34:49,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:34:49,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1954 transitions. [2025-03-08 05:34:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-08 05:34:49,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:49,593 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:49,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:34:49,593 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:49,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:49,593 INFO L85 PathProgramCache]: Analyzing trace with hash -348124132, now seen corresponding path program 1 times [2025-03-08 05:34:49,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:49,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524308018] [2025-03-08 05:34:49,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:49,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:49,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 05:34:49,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 05:34:49,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:49,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:49,806 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-08 05:34:49,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:49,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524308018] [2025-03-08 05:34:49,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524308018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:49,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:49,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:34:49,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963347940] [2025-03-08 05:34:49,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:49,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:34:49,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:49,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:34:49,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:34:49,808 INFO L87 Difference]: Start difference. First operand 1321 states and 1954 transitions. Second operand has 8 states, 6 states have (on average 16.833333333333332) internal successors, (101), 8 states have internal predecessors, (101), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 05:34:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:49,913 INFO L93 Difference]: Finished difference Result 2553 states and 3801 transitions. [2025-03-08 05:34:49,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:34:49,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 16.833333333333332) internal successors, (101), 8 states have internal predecessors, (101), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 178 [2025-03-08 05:34:49,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:49,921 INFO L225 Difference]: With dead ends: 2553 [2025-03-08 05:34:49,921 INFO L226 Difference]: Without dead ends: 1325 [2025-03-08 05:34:49,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:34:49,925 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 3 mSDsluCounter, 5004 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5841 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:49,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5841 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:49,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2025-03-08 05:34:49,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2025-03-08 05:34:49,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1010 states have (on average 1.4801980198019802) internal successors, (1495), 1033 states have internal predecessors, (1495), 223 states have call successors, (223), 86 states have call predecessors, (223), 91 states have return successors, (241), 221 states have call predecessors, (241), 221 states have call successors, (241) [2025-03-08 05:34:49,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1959 transitions. [2025-03-08 05:34:49,979 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1959 transitions. Word has length 178 [2025-03-08 05:34:49,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:49,980 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 1959 transitions. [2025-03-08 05:34:49,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 16.833333333333332) internal successors, (101), 8 states have internal predecessors, (101), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 05:34:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1959 transitions. [2025-03-08 05:34:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 05:34:49,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:49,984 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] [2025-03-08 05:34:49,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:34:49,984 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:49,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:49,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1480859277, now seen corresponding path program 1 times [2025-03-08 05:34:49,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:49,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658274818] [2025-03-08 05:34:49,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:49,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:50,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 05:34:50,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 05:34:50,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:50,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 05:34:50,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:50,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658274818] [2025-03-08 05:34:50,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658274818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:50,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:50,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:34:50,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547333939] [2025-03-08 05:34:50,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:50,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:34:50,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:50,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:34:50,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:34:50,166 INFO L87 Difference]: Start difference. First operand 1325 states and 1959 transitions. Second operand has 9 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 05:34:50,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:50,334 INFO L93 Difference]: Finished difference Result 2543 states and 3785 transitions. [2025-03-08 05:34:50,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:34:50,334 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) Word has length 179 [2025-03-08 05:34:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:50,342 INFO L225 Difference]: With dead ends: 2543 [2025-03-08 05:34:50,342 INFO L226 Difference]: Without dead ends: 1325 [2025-03-08 05:34:50,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:34:50,347 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 7 mSDsluCounter, 5773 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6602 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:50,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6602 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:34:50,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2025-03-08 05:34:50,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2025-03-08 05:34:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1010 states have (on average 1.4801980198019802) internal successors, (1495), 1033 states have internal predecessors, (1495), 223 states have call successors, (223), 86 states have call predecessors, (223), 91 states have return successors, (239), 221 states have call predecessors, (239), 221 states have call successors, (239) [2025-03-08 05:34:50,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1957 transitions. [2025-03-08 05:34:50,426 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1957 transitions. Word has length 179 [2025-03-08 05:34:50,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:50,427 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 1957 transitions. [2025-03-08 05:34:50,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 05:34:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1957 transitions. [2025-03-08 05:34:50,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 05:34:50,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:50,431 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:50,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:34:50,432 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:50,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:50,432 INFO L85 PathProgramCache]: Analyzing trace with hash 355328965, now seen corresponding path program 1 times [2025-03-08 05:34:50,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:50,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534710355] [2025-03-08 05:34:50,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:50,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:50,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 05:34:50,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 05:34:50,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:50,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-08 05:34:50,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:50,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534710355] [2025-03-08 05:34:50,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534710355] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:50,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783256939] [2025-03-08 05:34:50,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:50,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:50,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:50,584 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:50,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:34:50,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 05:34:50,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 05:34:50,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:50,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:50,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:34:50,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-08 05:34:50,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:34:50,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783256939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:50,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:34:50,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-08 05:34:50,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091924581] [2025-03-08 05:34:50,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:50,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:34:50,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:50,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:34:50,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:34:50,934 INFO L87 Difference]: Start difference. First operand 1325 states and 1957 transitions. Second operand has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 05:34:51,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:51,036 INFO L93 Difference]: Finished difference Result 1973 states and 2919 transitions. [2025-03-08 05:34:51,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:34:51,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 180 [2025-03-08 05:34:51,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:51,044 INFO L225 Difference]: With dead ends: 1973 [2025-03-08 05:34:51,044 INFO L226 Difference]: Without dead ends: 1331 [2025-03-08 05:34:51,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:34:51,047 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 1 mSDsluCounter, 3334 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4172 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:51,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4172 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:51,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-03-08 05:34:51,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1327. [2025-03-08 05:34:51,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 1011 states have (on average 1.479723046488625) internal successors, (1496), 1035 states have internal predecessors, (1496), 223 states have call successors, (223), 86 states have call predecessors, (223), 92 states have return successors, (242), 221 states have call predecessors, (242), 221 states have call successors, (242) [2025-03-08 05:34:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1961 transitions. [2025-03-08 05:34:51,105 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1961 transitions. Word has length 180 [2025-03-08 05:34:51,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:51,106 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 1961 transitions. [2025-03-08 05:34:51,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 05:34:51,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1961 transitions. [2025-03-08 05:34:51,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 05:34:51,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:51,110 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:51,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 05:34:51,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 05:34:51,311 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:51,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:51,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1353485452, now seen corresponding path program 2 times [2025-03-08 05:34:51,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:51,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008605544] [2025-03-08 05:34:51,311 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:34:51,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:51,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 180 statements into 2 equivalence classes. [2025-03-08 05:34:51,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 180 statements. [2025-03-08 05:34:51,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:34:51,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-08 05:34:51,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:51,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008605544] [2025-03-08 05:34:51,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008605544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:51,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:51,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:34:51,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782865457] [2025-03-08 05:34:51,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:51,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:34:51,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:51,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:34:51,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:34:51,432 INFO L87 Difference]: Start difference. First operand 1327 states and 1961 transitions. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:34:51,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:51,908 INFO L93 Difference]: Finished difference Result 2622 states and 3908 transitions. [2025-03-08 05:34:51,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:34:51,909 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2025-03-08 05:34:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:51,923 INFO L225 Difference]: With dead ends: 2622 [2025-03-08 05:34:51,924 INFO L226 Difference]: Without dead ends: 2614 [2025-03-08 05:34:51,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:34:51,926 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 1312 mSDsluCounter, 4088 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1312 SdHoareTripleChecker+Valid, 4952 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:51,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1312 Valid, 4952 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:34:51,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2614 states. [2025-03-08 05:34:52,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2614 to 2595. [2025-03-08 05:34:52,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2595 states, 1984 states have (on average 1.487399193548387) internal successors, (2951), 2031 states have internal predecessors, (2951), 429 states have call successors, (429), 168 states have call predecessors, (429), 181 states have return successors, (488), 427 states have call predecessors, (488), 425 states have call successors, (488) [2025-03-08 05:34:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 3868 transitions. [2025-03-08 05:34:52,053 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 3868 transitions. Word has length 180 [2025-03-08 05:34:52,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:52,054 INFO L471 AbstractCegarLoop]: Abstraction has 2595 states and 3868 transitions. [2025-03-08 05:34:52,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:34:52,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 3868 transitions. [2025-03-08 05:34:52,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 05:34:52,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:52,061 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:52,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:34:52,061 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:52,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:52,061 INFO L85 PathProgramCache]: Analyzing trace with hash -23208084, now seen corresponding path program 1 times [2025-03-08 05:34:52,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:52,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887871258] [2025-03-08 05:34:52,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:52,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:52,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 05:34:52,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 05:34:52,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:52,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-08 05:34:52,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:52,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887871258] [2025-03-08 05:34:52,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887871258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:52,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378897094] [2025-03-08 05:34:52,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:52,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:52,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:52,183 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:52,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:34:52,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 05:34:52,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 05:34:52,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:52,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:52,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:34:52,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:52,510 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-08 05:34:52,511 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:34:52,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378897094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:52,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:34:52,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-08 05:34:52,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792763484] [2025-03-08 05:34:52,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:52,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:34:52,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:52,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:34:52,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:34:52,513 INFO L87 Difference]: Start difference. First operand 2595 states and 3868 transitions. Second operand has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 05:34:52,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:52,621 INFO L93 Difference]: Finished difference Result 5053 states and 7565 transitions. [2025-03-08 05:34:52,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:34:52,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 181 [2025-03-08 05:34:52,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:52,636 INFO L225 Difference]: With dead ends: 5053 [2025-03-08 05:34:52,636 INFO L226 Difference]: Without dead ends: 2599 [2025-03-08 05:34:52,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:34:52,644 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 1 mSDsluCounter, 3323 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4158 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:52,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4158 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:52,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2599 states. [2025-03-08 05:34:52,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2599 to 2595. [2025-03-08 05:34:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2595 states, 1984 states have (on average 1.487399193548387) internal successors, (2951), 2031 states have internal predecessors, (2951), 429 states have call successors, (429), 168 states have call predecessors, (429), 181 states have return successors, (484), 427 states have call predecessors, (484), 425 states have call successors, (484) [2025-03-08 05:34:52,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 3864 transitions. [2025-03-08 05:34:52,779 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 3864 transitions. Word has length 181 [2025-03-08 05:34:52,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:52,779 INFO L471 AbstractCegarLoop]: Abstraction has 2595 states and 3864 transitions. [2025-03-08 05:34:52,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 05:34:52,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 3864 transitions. [2025-03-08 05:34:52,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 05:34:52,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:52,785 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:52,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 05:34:52,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 05:34:52,989 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:52,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:52,990 INFO L85 PathProgramCache]: Analyzing trace with hash -967756592, now seen corresponding path program 1 times [2025-03-08 05:34:52,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:52,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578409123] [2025-03-08 05:34:52,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:52,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:53,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 05:34:53,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 05:34:53,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:53,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-08 05:34:53,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:53,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578409123] [2025-03-08 05:34:53,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578409123] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:53,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318866030] [2025-03-08 05:34:53,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:53,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:53,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:53,106 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:53,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 05:34:53,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 05:34:53,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 05:34:53,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:53,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:53,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 1379 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:34:53,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:53,414 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-03-08 05:34:53,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:34:53,524 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-03-08 05:34:53,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318866030] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:34:53,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:34:53,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2025-03-08 05:34:53,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498212613] [2025-03-08 05:34:53,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:34:53,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:34:53,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:53,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:34:53,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:34:53,526 INFO L87 Difference]: Start difference. First operand 2595 states and 3864 transitions. Second operand has 10 states, 9 states have (on average 16.0) internal successors, (144), 10 states have internal predecessors, (144), 3 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2025-03-08 05:34:53,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:53,829 INFO L93 Difference]: Finished difference Result 6295 states and 9634 transitions. [2025-03-08 05:34:53,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:34:53,830 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 16.0) internal successors, (144), 10 states have internal predecessors, (144), 3 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 182 [2025-03-08 05:34:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:53,853 INFO L225 Difference]: With dead ends: 6295 [2025-03-08 05:34:53,854 INFO L226 Difference]: Without dead ends: 4362 [2025-03-08 05:34:53,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:34:53,861 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 750 mSDsluCounter, 5648 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 6545 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:53,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 6545 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:34:53,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4362 states. [2025-03-08 05:34:54,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4362 to 4276. [2025-03-08 05:34:54,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 3427 states have (on average 1.5304931426903998) internal successors, (5245), 3461 states have internal predecessors, (5245), 674 states have call successors, (674), 164 states have call predecessors, (674), 174 states have return successors, (789), 682 states have call predecessors, (789), 670 states have call successors, (789) [2025-03-08 05:34:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 6708 transitions. [2025-03-08 05:34:54,082 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 6708 transitions. Word has length 182 [2025-03-08 05:34:54,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:54,082 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 6708 transitions. [2025-03-08 05:34:54,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 16.0) internal successors, (144), 10 states have internal predecessors, (144), 3 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2025-03-08 05:34:54,083 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 6708 transitions. [2025-03-08 05:34:54,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-08 05:34:54,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:54,097 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:54,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 05:34:54,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:54,298 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:54,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:54,299 INFO L85 PathProgramCache]: Analyzing trace with hash -968698002, now seen corresponding path program 1 times [2025-03-08 05:34:54,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:54,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157105643] [2025-03-08 05:34:54,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:54,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:54,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 05:34:54,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 05:34:54,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:54,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-08 05:34:54,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:54,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157105643] [2025-03-08 05:34:54,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157105643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:54,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:54,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:54,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580841843] [2025-03-08 05:34:54,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:54,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:54,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:54,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:54,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:54,360 INFO L87 Difference]: Start difference. First operand 4276 states and 6708 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 05:34:54,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:54,493 INFO L93 Difference]: Finished difference Result 9982 states and 15861 transitions. [2025-03-08 05:34:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:54,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 201 [2025-03-08 05:34:54,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:54,528 INFO L225 Difference]: With dead ends: 9982 [2025-03-08 05:34:54,528 INFO L226 Difference]: Without dead ends: 5910 [2025-03-08 05:34:54,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:54,541 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 163 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:54,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1689 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:54,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5910 states. [2025-03-08 05:34:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5910 to 5878. [2025-03-08 05:34:54,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5878 states, 4775 states have (on average 1.5390575916230367) internal successors, (7349), 4797 states have internal predecessors, (7349), 928 states have call successors, (928), 164 states have call predecessors, (928), 174 states have return successors, (1111), 948 states have call predecessors, (1111), 924 states have call successors, (1111) [2025-03-08 05:34:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 9388 transitions. [2025-03-08 05:34:54,714 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 9388 transitions. Word has length 201 [2025-03-08 05:34:54,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:54,714 INFO L471 AbstractCegarLoop]: Abstraction has 5878 states and 9388 transitions. [2025-03-08 05:34:54,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 05:34:54,715 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 9388 transitions. [2025-03-08 05:34:54,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 05:34:54,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:54,732 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:54,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:34:54,732 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:54,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:54,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1397687648, now seen corresponding path program 1 times [2025-03-08 05:34:54,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:54,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149284474] [2025-03-08 05:34:54,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:54,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:54,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 05:34:54,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 05:34:54,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:54,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-08 05:34:54,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:54,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149284474] [2025-03-08 05:34:54,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149284474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:54,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:54,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:54,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741322985] [2025-03-08 05:34:54,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:54,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:54,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:54,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:54,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:54,789 INFO L87 Difference]: Start difference. First operand 5878 states and 9388 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:34:54,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:54,960 INFO L93 Difference]: Finished difference Result 14606 states and 23601 transitions. [2025-03-08 05:34:54,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:54,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 188 [2025-03-08 05:34:54,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:54,991 INFO L225 Difference]: With dead ends: 14606 [2025-03-08 05:34:54,991 INFO L226 Difference]: Without dead ends: 9066 [2025-03-08 05:34:55,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:55,004 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 161 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:55,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1682 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:55,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9066 states. [2025-03-08 05:34:55,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9066 to 9034. [2025-03-08 05:34:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9034 states, 7455 states have (on average 1.5556002682763246) internal successors, (11597), 7477 states have internal predecessors, (11597), 1404 states have call successors, (1404), 164 states have call predecessors, (1404), 174 states have return successors, (1651), 1424 states have call predecessors, (1651), 1400 states have call successors, (1651) [2025-03-08 05:34:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9034 states to 9034 states and 14652 transitions. [2025-03-08 05:34:55,268 INFO L78 Accepts]: Start accepts. Automaton has 9034 states and 14652 transitions. Word has length 188 [2025-03-08 05:34:55,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:55,269 INFO L471 AbstractCegarLoop]: Abstraction has 9034 states and 14652 transitions. [2025-03-08 05:34:55,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:34:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 9034 states and 14652 transitions. [2025-03-08 05:34:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 05:34:55,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:55,295 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:55,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:34:55,295 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:55,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:55,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2106812002, now seen corresponding path program 1 times [2025-03-08 05:34:55,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:55,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371499893] [2025-03-08 05:34:55,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:55,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:55,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 05:34:55,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 05:34:55,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:55,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:55,381 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-08 05:34:55,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:55,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371499893] [2025-03-08 05:34:55,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371499893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:55,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:55,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:55,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707990699] [2025-03-08 05:34:55,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:55,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:55,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:55,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:55,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:55,384 INFO L87 Difference]: Start difference. First operand 9034 states and 14652 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 05:34:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:55,583 INFO L93 Difference]: Finished difference Result 21544 states and 35257 transitions. [2025-03-08 05:34:55,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:55,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 210 [2025-03-08 05:34:55,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:55,631 INFO L225 Difference]: With dead ends: 21544 [2025-03-08 05:34:55,631 INFO L226 Difference]: Without dead ends: 13376 [2025-03-08 05:34:55,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:55,658 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 159 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:55,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1679 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:55,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13376 states. [2025-03-08 05:34:56,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13376 to 13344. [2025-03-08 05:34:56,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13344 states, 11195 states have (on average 1.5652523447967843) internal successors, (17523), 11199 states have internal predecessors, (17523), 1974 states have call successors, (1974), 164 states have call predecessors, (1974), 174 states have return successors, (2371), 2012 states have call predecessors, (2371), 1970 states have call successors, (2371) [2025-03-08 05:34:56,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13344 states to 13344 states and 21868 transitions. [2025-03-08 05:34:56,278 INFO L78 Accepts]: Start accepts. Automaton has 13344 states and 21868 transitions. Word has length 210 [2025-03-08 05:34:56,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:56,279 INFO L471 AbstractCegarLoop]: Abstraction has 13344 states and 21868 transitions. [2025-03-08 05:34:56,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 05:34:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 13344 states and 21868 transitions. [2025-03-08 05:34:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 05:34:56,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:56,309 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:56,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:34:56,309 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:56,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:56,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1437771313, now seen corresponding path program 1 times [2025-03-08 05:34:56,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:56,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474222774] [2025-03-08 05:34:56,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:56,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:56,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 05:34:56,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 05:34:56,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:56,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-08 05:34:56,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:56,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474222774] [2025-03-08 05:34:56,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474222774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:56,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:56,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:56,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637224561] [2025-03-08 05:34:56,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:56,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:56,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:56,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:56,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:56,362 INFO L87 Difference]: Start difference. First operand 13344 states and 21868 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 05:34:56,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:56,707 INFO L93 Difference]: Finished difference Result 32282 states and 53373 transitions. [2025-03-08 05:34:56,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:56,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 204 [2025-03-08 05:34:56,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:56,785 INFO L225 Difference]: With dead ends: 32282 [2025-03-08 05:34:56,786 INFO L226 Difference]: Without dead ends: 20472 [2025-03-08 05:34:56,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:56,815 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 157 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:56,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1679 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:56,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20472 states. [2025-03-08 05:34:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20472 to 20440. [2025-03-08 05:34:57,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20440 states, 17411 states have (on average 1.5746941588650853) internal successors, (27417), 17391 states have internal predecessors, (27417), 2854 states have call successors, (2854), 164 states have call predecessors, (2854), 174 states have return successors, (3507), 2916 states have call predecessors, (3507), 2850 states have call successors, (3507) [2025-03-08 05:34:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20440 states to 20440 states and 33778 transitions. [2025-03-08 05:34:57,424 INFO L78 Accepts]: Start accepts. Automaton has 20440 states and 33778 transitions. Word has length 204 [2025-03-08 05:34:57,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:57,425 INFO L471 AbstractCegarLoop]: Abstraction has 20440 states and 33778 transitions. [2025-03-08 05:34:57,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 05:34:57,425 INFO L276 IsEmpty]: Start isEmpty. Operand 20440 states and 33778 transitions. [2025-03-08 05:34:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 05:34:57,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:57,458 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:57,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:34:57,458 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:57,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:57,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1453475998, now seen corresponding path program 1 times [2025-03-08 05:34:57,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:57,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608926081] [2025-03-08 05:34:57,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:57,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:57,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 05:34:57,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 05:34:57,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:57,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-08 05:34:57,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:57,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608926081] [2025-03-08 05:34:57,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608926081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:57,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:57,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:57,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267634376] [2025-03-08 05:34:57,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:57,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:57,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:57,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:57,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:57,512 INFO L87 Difference]: Start difference. First operand 20440 states and 33778 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:34:58,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:58,320 INFO L93 Difference]: Finished difference Result 50592 states and 84193 transitions. [2025-03-08 05:34:58,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:58,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 191 [2025-03-08 05:34:58,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:58,441 INFO L225 Difference]: With dead ends: 50592 [2025-03-08 05:34:58,442 INFO L226 Difference]: Without dead ends: 32660 [2025-03-08 05:34:58,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:58,489 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 155 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:58,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1686 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32660 states. [2025-03-08 05:34:59,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32660 to 32628. [2025-03-08 05:34:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32628 states, 27779 states have (on average 1.5734547679902084) internal successors, (43709), 27729 states have internal predecessors, (43709), 4674 states have call successors, (4674), 164 states have call predecessors, (4674), 174 states have return successors, (5785), 4766 states have call predecessors, (5785), 4670 states have call successors, (5785) [2025-03-08 05:34:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32628 states to 32628 states and 54168 transitions. [2025-03-08 05:34:59,813 INFO L78 Accepts]: Start accepts. Automaton has 32628 states and 54168 transitions. Word has length 191 [2025-03-08 05:34:59,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:59,814 INFO L471 AbstractCegarLoop]: Abstraction has 32628 states and 54168 transitions. [2025-03-08 05:34:59,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:34:59,814 INFO L276 IsEmpty]: Start isEmpty. Operand 32628 states and 54168 transitions. [2025-03-08 05:34:59,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 05:34:59,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:59,858 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:59,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:34:59,859 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:59,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:59,859 INFO L85 PathProgramCache]: Analyzing trace with hash -234860272, now seen corresponding path program 1 times [2025-03-08 05:34:59,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:59,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074844008] [2025-03-08 05:34:59,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:59,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:59,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 05:34:59,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 05:34:59,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:59,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:59,916 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-08 05:34:59,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:59,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074844008] [2025-03-08 05:34:59,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074844008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:59,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:59,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:59,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643873744] [2025-03-08 05:34:59,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:59,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:59,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:59,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:59,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:59,919 INFO L87 Difference]: Start difference. First operand 32628 states and 54168 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 05:35:00,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:00,792 INFO L93 Difference]: Finished difference Result 85180 states and 142365 transitions. [2025-03-08 05:35:00,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:35:00,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 206 [2025-03-08 05:35:00,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:01,004 INFO L225 Difference]: With dead ends: 85180 [2025-03-08 05:35:01,004 INFO L226 Difference]: Without dead ends: 56292 [2025-03-08 05:35:01,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:01,070 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 153 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:35:01,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1682 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:01,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56292 states. [2025-03-08 05:35:02,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56292 to 56260. [2025-03-08 05:35:02,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56260 states, 48123 states have (on average 1.5810527190740395) internal successors, (76085), 48073 states have internal predecessors, (76085), 7962 states have call successors, (7962), 164 states have call predecessors, (7962), 174 states have return successors, (9673), 8054 states have call predecessors, (9673), 7958 states have call successors, (9673) [2025-03-08 05:35:03,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56260 states to 56260 states and 93720 transitions. [2025-03-08 05:35:03,162 INFO L78 Accepts]: Start accepts. Automaton has 56260 states and 93720 transitions. Word has length 206 [2025-03-08 05:35:03,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:03,163 INFO L471 AbstractCegarLoop]: Abstraction has 56260 states and 93720 transitions. [2025-03-08 05:35:03,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 05:35:03,163 INFO L276 IsEmpty]: Start isEmpty. Operand 56260 states and 93720 transitions. [2025-03-08 05:35:03,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-08 05:35:03,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:03,242 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:03,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 05:35:03,242 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:03,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:03,242 INFO L85 PathProgramCache]: Analyzing trace with hash -959085103, now seen corresponding path program 1 times [2025-03-08 05:35:03,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:03,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937582258] [2025-03-08 05:35:03,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:03,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:03,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 05:35:03,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 05:35:03,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:03,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-08 05:35:03,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:03,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937582258] [2025-03-08 05:35:03,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937582258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:03,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:03,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:35:03,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692870526] [2025-03-08 05:35:03,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:03,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:35:03,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:03,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:35:03,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:03,318 INFO L87 Difference]: Start difference. First operand 56260 states and 93720 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 05:35:05,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:05,113 INFO L93 Difference]: Finished difference Result 138382 states and 229861 transitions. [2025-03-08 05:35:05,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:35:05,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 207 [2025-03-08 05:35:05,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:05,658 INFO L225 Difference]: With dead ends: 138382 [2025-03-08 05:35:05,658 INFO L226 Difference]: Without dead ends: 89578 [2025-03-08 05:35:05,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:05,754 INFO L435 NwaCegarLoop]: 871 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, 1682 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:35:05,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1682 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:05,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89578 states. [2025-03-08 05:35:08,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89578 to 89546. [2025-03-08 05:35:08,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89546 states, 76747 states have (on average 1.5547317810468162) internal successors, (119321), 76661 states have internal predecessors, (119321), 12624 states have call successors, (12624), 164 states have call predecessors, (12624), 174 states have return successors, (15711), 12752 states have call predecessors, (15711), 12620 states have call successors, (15711) [2025-03-08 05:35:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89546 states to 89546 states and 147656 transitions. [2025-03-08 05:35:08,995 INFO L78 Accepts]: Start accepts. Automaton has 89546 states and 147656 transitions. Word has length 207 [2025-03-08 05:35:08,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:08,995 INFO L471 AbstractCegarLoop]: Abstraction has 89546 states and 147656 transitions. [2025-03-08 05:35:08,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 05:35:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 89546 states and 147656 transitions. [2025-03-08 05:35:09,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 05:35:09,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:09,079 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:09,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 05:35:09,080 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:09,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:09,080 INFO L85 PathProgramCache]: Analyzing trace with hash 713133181, now seen corresponding path program 1 times [2025-03-08 05:35:09,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:09,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411045341] [2025-03-08 05:35:09,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:09,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:09,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 05:35:09,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 05:35:09,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:09,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:09,133 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-08 05:35:09,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:09,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411045341] [2025-03-08 05:35:09,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411045341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:09,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:09,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:35:09,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948833279] [2025-03-08 05:35:09,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:09,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:35:09,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:09,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:35:09,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:09,134 INFO L87 Difference]: Start difference. First operand 89546 states and 147656 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:35:12,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:12,146 INFO L93 Difference]: Finished difference Result 241142 states and 399379 transitions. [2025-03-08 05:35:12,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:35:12,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 194 [2025-03-08 05:35:12,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:12,765 INFO L225 Difference]: With dead ends: 241142 [2025-03-08 05:35:12,765 INFO L226 Difference]: Without dead ends: 161122 [2025-03-08 05:35:12,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:12,968 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 149 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:35:12,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1683 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:13,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161122 states. [2025-03-08 05:35:17,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161122 to 161090. [2025-03-08 05:35:18,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161090 states, 138691 states have (on average 1.5550756718172052) internal successors, (215675), 138563 states have internal predecessors, (215675), 22224 states have call successors, (22224), 164 states have call predecessors, (22224), 174 states have return successors, (27977), 22394 states have call predecessors, (27977), 22220 states have call successors, (27977) [2025-03-08 05:35:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161090 states to 161090 states and 265876 transitions. [2025-03-08 05:35:18,892 INFO L78 Accepts]: Start accepts. Automaton has 161090 states and 265876 transitions. Word has length 194 [2025-03-08 05:35:18,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:18,892 INFO L471 AbstractCegarLoop]: Abstraction has 161090 states and 265876 transitions. [2025-03-08 05:35:18,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:35:18,892 INFO L276 IsEmpty]: Start isEmpty. Operand 161090 states and 265876 transitions. [2025-03-08 05:35:19,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-08 05:35:19,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:19,029 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:19,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 05:35:19,029 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:19,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:19,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1558235488, now seen corresponding path program 1 times [2025-03-08 05:35:19,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:19,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487918218] [2025-03-08 05:35:19,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:19,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:19,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 05:35:19,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 05:35:19,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:19,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-08 05:35:19,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:19,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487918218] [2025-03-08 05:35:19,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487918218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:19,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:19,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:35:19,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523530882] [2025-03-08 05:35:19,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:19,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:35:19,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:19,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:35:19,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:19,102 INFO L87 Difference]: Start difference. First operand 161090 states and 265876 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)