./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec9_productSimulator.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec9_productSimulator.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a46e94d21677d8e787ff51041171bb0d6a97c638f1cb1f2181c1b14c15718344 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:28:14,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:28:14,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:28:14,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:28:14,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:28:15,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:28:15,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:28:15,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:28:15,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:28:15,006 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:28:15,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:28:15,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:28:15,006 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:28:15,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:28:15,006 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:28:15,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:28:15,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:28:15,007 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:28:15,007 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:28:15,007 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:28:15,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:28:15,007 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:28:15,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:28:15,007 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:28:15,007 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:28:15,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:28:15,007 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:28:15,007 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:28:15,007 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:28:15,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:28:15,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:28:15,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:28:15,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:28:15,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:28:15,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:28:15,007 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:28:15,008 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:28:15,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:28:15,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:28:15,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:28:15,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:28:15,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:28:15,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:28:15,008 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a46e94d21677d8e787ff51041171bb0d6a97c638f1cb1f2181c1b14c15718344 [2025-03-03 14:28:15,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:28:15,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:28:15,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:28:15,279 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:28:15,279 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:28:15,281 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec9_productSimulator.cil.c [2025-03-03 14:28:16,410 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad0de763/1ef153f094dc42b689d2dbf51e842781/FLAG40dcf7f17 [2025-03-03 14:28:16,720 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:28:16,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_productSimulator.cil.c [2025-03-03 14:28:16,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad0de763/1ef153f094dc42b689d2dbf51e842781/FLAG40dcf7f17 [2025-03-03 14:28:16,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad0de763/1ef153f094dc42b689d2dbf51e842781 [2025-03-03 14:28:16,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:28:16,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:28:16,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:28:16,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:28:16,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:28:16,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:28:16" (1/1) ... [2025-03-03 14:28:16,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eeb866c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:16, skipping insertion in model container [2025-03-03 14:28:16,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:28:16" (1/1) ... [2025-03-03 14:28:16,791 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:28:17,084 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_productSimulator.cil.c[31629,31642] [2025-03-03 14:28:17,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:28:17,223 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:28:17,229 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-03-03 14:28:17,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [335] [2025-03-03 14:28:17,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [747] [2025-03-03 14:28:17,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1323] [2025-03-03 14:28:17,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1686] [2025-03-03 14:28:17,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1695] [2025-03-03 14:28:17,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [2061] [2025-03-03 14:28:17,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2103] [2025-03-03 14:28:17,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2210] [2025-03-03 14:28:17,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2414] [2025-03-03 14:28:17,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [2431] [2025-03-03 14:28:17,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_productSimulator.cil.c[31629,31642] [2025-03-03 14:28:17,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:28:17,340 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:28:17,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:17 WrapperNode [2025-03-03 14:28:17,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:28:17,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:28:17,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:28:17,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:28:17,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:17" (1/1) ... [2025-03-03 14:28:17,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:17" (1/1) ... [2025-03-03 14:28:17,417 INFO L138 Inliner]: procedures = 152, calls = 266, calls flagged for inlining = 68, calls inlined = 65, statements flattened = 1328 [2025-03-03 14:28:17,417 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:28:17,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:28:17,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:28:17,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:28:17,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:17" (1/1) ... [2025-03-03 14:28:17,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:17" (1/1) ... [2025-03-03 14:28:17,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:17" (1/1) ... [2025-03-03 14:28:17,461 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-03 14:28:17,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:17" (1/1) ... [2025-03-03 14:28:17,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:17" (1/1) ... [2025-03-03 14:28:17,482 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:17" (1/1) ... [2025-03-03 14:28:17,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:17" (1/1) ... [2025-03-03 14:28:17,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:17" (1/1) ... [2025-03-03 14:28:17,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:17" (1/1) ... [2025-03-03 14:28:17,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:28:17,506 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:28:17,506 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:28:17,506 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:28:17,507 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:17" (1/1) ... [2025-03-03 14:28:17,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:28:17,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:28:17,532 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-03 14:28:17,535 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-03 14:28:17,555 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-03 14:28:17,555 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-03 14:28:17,555 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-03-03 14:28:17,556 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-03-03 14:28:17,556 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-03-03 14:28:17,556 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-03-03 14:28:17,556 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-03 14:28:17,556 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-03 14:28:17,556 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:28:17,556 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:28:17,556 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-03 14:28:17,556 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-03 14:28:17,556 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:28:17,556 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:28:17,556 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-03-03 14:28:17,556 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-03-03 14:28:17,556 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:28:17,557 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:28:17,557 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-03-03 14:28:17,557 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-03-03 14:28:17,557 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:28:17,558 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:28:17,558 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:28:17,558 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:28:17,558 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:28:17,558 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:28:17,558 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-03-03 14:28:17,558 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-03-03 14:28:17,558 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-03-03 14:28:17,558 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-03-03 14:28:17,558 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:28:17,558 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:28:17,558 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:28:17,558 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:28:17,558 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:28:17,558 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:28:17,558 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-03-03 14:28:17,558 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-03-03 14:28:17,558 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:28:17,558 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:28:17,558 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-03 14:28:17,558 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-03 14:28:17,558 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:28:17,558 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:28:17,559 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-03-03 14:28:17,560 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-03-03 14:28:17,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:28:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:28:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:28:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:28:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:28:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-03-03 14:28:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-03-03 14:28:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-03-03 14:28:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-03-03 14:28:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-03-03 14:28:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-03-03 14:28:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-03 14:28:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-03 14:28:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:28:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:28:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:28:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:28:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:28:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:28:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:28:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:28:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:28:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:28:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:28:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:28:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-03-03 14:28:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-03-03 14:28:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-03-03 14:28:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-03-03 14:28:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:28:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:28:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:28:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:28:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:28:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:28:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:28:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:28:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:28:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:28:17,562 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-03-03 14:28:17,562 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-03-03 14:28:17,562 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-03-03 14:28:17,562 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-03-03 14:28:17,562 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-03 14:28:17,562 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-03 14:28:17,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:28:17,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:28:17,746 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:28:17,748 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:28:17,798 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2349: #res := ~retValue_acc~22; [2025-03-03 14:28:17,811 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L654: #res := ~retValue_acc~8; [2025-03-03 14:28:17,826 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1207: #res := ~retValue_acc~15; [2025-03-03 14:28:17,844 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: #res := ~retValue_acc~37; [2025-03-03 14:28:17,927 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2577: #res := ~retValue_acc~31; [2025-03-03 14:28:17,970 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L391-1: getEmailId_#res#1 := getEmailId_~retValue_acc~1#1; [2025-03-03 14:28:18,009 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L617: #res := ~retValue_acc~7; [2025-03-03 14:28:18,037 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L465: #res := ~retValue_acc~3; [2025-03-03 14:28:18,075 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2369-1: isReadable__role__Encrypt_#res#1 := isReadable__role__Encrypt_~retValue_acc~23#1; [2025-03-03 14:28:18,075 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2387: #res#1 := ~retValue_acc~24#1; [2025-03-03 14:28:18,137 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3125: #res#1 := ~retValue_acc~39#1; [2025-03-03 14:28:18,137 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~38#1; [2025-03-03 14:28:18,190 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3349: #res := ~retValue_acc~42; [2025-03-03 14:28:18,198 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2411-1: createEmail_#res#1 := createEmail_~retValue_acc~26#1; [2025-03-03 14:28:18,203 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L580: #res := ~retValue_acc~6; [2025-03-03 14:28:18,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3468-1: getClientId_#res#1 := getClientId_~retValue_acc~44#1; [2025-03-03 14:28:18,269 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3421-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~43#1; [2025-03-03 14:28:18,269 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L728-1: isVerified_#res#1 := isVerified_~retValue_acc~10#1; [2025-03-03 14:28:18,273 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: #res := ~retValue_acc~9; [2025-03-03 14:28:18,295 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2112: #res := ~retValue_acc~20; [2025-03-03 14:28:18,312 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2903: #res := ~retValue_acc~35; [2025-03-03 14:28:18,329 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2986-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~36#1; [2025-03-03 14:28:18,622 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1164-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~12#1; [2025-03-03 14:28:18,622 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3295-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~41#1; [2025-03-03 14:28:18,622 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1182-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~14#1; [2025-03-03 14:28:18,622 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2207-1: valid_product_#res#1 := valid_product_~retValue_acc~21#1; [2025-03-03 14:28:18,622 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1173-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~13#1; [2025-03-03 14:28:18,622 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3188-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~40#1; [2025-03-03 14:28:18,630 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L428: #res := ~retValue_acc~2; [2025-03-03 14:28:18,769 INFO L? ?]: Removed 629 outVars from TransFormulas that were not future-live. [2025-03-03 14:28:18,770 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:28:18,789 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:28:18,790 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:28:18,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:28:18 BoogieIcfgContainer [2025-03-03 14:28:18,790 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:28:18,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:28:18,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:28:18,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:28:18,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:28:16" (1/3) ... [2025-03-03 14:28:18,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1017a7f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:28:18, skipping insertion in model container [2025-03-03 14:28:18,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:17" (2/3) ... [2025-03-03 14:28:18,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1017a7f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:28:18, skipping insertion in model container [2025-03-03 14:28:18,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:28:18" (3/3) ... [2025-03-03 14:28:18,800 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec9_productSimulator.cil.c [2025-03-03 14:28:18,809 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:28:18,812 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec9_productSimulator.cil.c that has 44 procedures, 603 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:28:18,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:28:18,894 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;@671e9a48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:28:18,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:28:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 603 states, 448 states have (on average 1.5133928571428572) internal successors, (678), 468 states have internal predecessors, (678), 110 states have call successors, (110), 43 states have call predecessors, (110), 43 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-03 14:28:18,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 14:28:18,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:18,918 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:18,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:18,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:18,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1092424816, now seen corresponding path program 1 times [2025-03-03 14:28:18,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:18,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747608645] [2025-03-03 14:28:18,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:18,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:19,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:28:19,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:28:19,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:19,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:19,269 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-03 14:28:19,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:19,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747608645] [2025-03-03 14:28:19,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747608645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:19,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:19,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:28:19,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192955964] [2025-03-03 14:28:19,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:19,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:28:19,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:19,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:28:19,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:28:19,289 INFO L87 Difference]: Start difference. First operand has 603 states, 448 states have (on average 1.5133928571428572) internal successors, (678), 468 states have internal predecessors, (678), 110 states have call successors, (110), 43 states have call predecessors, (110), 43 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:28:19,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:19,339 INFO L93 Difference]: Finished difference Result 938 states and 1377 transitions. [2025-03-03 14:28:19,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:28:19,340 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 127 [2025-03-03 14:28:19,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:19,351 INFO L225 Difference]: With dead ends: 938 [2025-03-03 14:28:19,351 INFO L226 Difference]: Without dead ends: 596 [2025-03-03 14:28:19,355 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-03 14:28:19,356 INFO L435 NwaCegarLoop]: 895 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, 895 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-03 14:28:19,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:19,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-03 14:28:19,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-03-03 14:28:19,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 442 states have (on average 1.51131221719457) internal successors, (668), 461 states have internal predecessors, (668), 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-03 14:28:19,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 887 transitions. [2025-03-03 14:28:19,427 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 887 transitions. Word has length 127 [2025-03-03 14:28:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:19,428 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 887 transitions. [2025-03-03 14:28:19,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:28:19,428 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 887 transitions. [2025-03-03 14:28:19,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 14:28:19,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:19,434 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] [2025-03-03 14:28:19,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:28:19,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:19,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:19,435 INFO L85 PathProgramCache]: Analyzing trace with hash -725998881, now seen corresponding path program 1 times [2025-03-03 14:28:19,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:19,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682703789] [2025-03-03 14:28:19,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:19,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:19,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 14:28:19,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 14:28:19,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:19,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:19,732 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-03 14:28:19,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:19,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682703789] [2025-03-03 14:28:19,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682703789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:19,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:19,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:28:19,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628314428] [2025-03-03 14:28:19,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:19,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:28:19,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:19,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:28:19,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:28:19,738 INFO L87 Difference]: Start difference. First operand 596 states and 887 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:28:19,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:19,829 INFO L93 Difference]: Finished difference Result 1156 states and 1718 transitions. [2025-03-03 14:28:19,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:28:19,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 128 [2025-03-03 14:28:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:19,836 INFO L225 Difference]: With dead ends: 1156 [2025-03-03 14:28:19,836 INFO L226 Difference]: Without dead ends: 596 [2025-03-03 14:28:19,839 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-03 14:28:19,840 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 0 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3528 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-03 14:28:19,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3528 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:19,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-03 14:28:19,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-03-03 14:28:19,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 442 states have (on average 1.495475113122172) internal successors, (661), 461 states have internal predecessors, (661), 110 states have call successors, (110), 43 states have call predecessors, (110), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-03-03 14:28:19,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 880 transitions. [2025-03-03 14:28:19,878 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 880 transitions. Word has length 128 [2025-03-03 14:28:19,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:19,879 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 880 transitions. [2025-03-03 14:28:19,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:28:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 880 transitions. [2025-03-03 14:28:19,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:28:19,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:19,883 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-03 14:28:19,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:28:19,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:19,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:19,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1507398243, now seen corresponding path program 1 times [2025-03-03 14:28:19,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:19,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492807567] [2025-03-03 14:28:19,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:19,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:19,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:28:19,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:28:19,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:19,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:20,042 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-03 14:28:20,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:20,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492807567] [2025-03-03 14:28:20,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492807567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:20,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:20,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:28:20,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010811168] [2025-03-03 14:28:20,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:20,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:28:20,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:20,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:28:20,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:28:20,044 INFO L87 Difference]: Start difference. First operand 596 states and 880 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:28:20,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:20,112 INFO L93 Difference]: Finished difference Result 1166 states and 1742 transitions. [2025-03-03 14:28:20,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:28:20,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 133 [2025-03-03 14:28:20,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:20,119 INFO L225 Difference]: With dead ends: 1166 [2025-03-03 14:28:20,119 INFO L226 Difference]: Without dead ends: 595 [2025-03-03 14:28:20,121 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-03 14:28:20,122 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 846 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:20,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 873 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:20,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-03 14:28:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2025-03-03 14:28:20,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 443 states have (on average 1.4830699774266365) internal successors, (657), 460 states have internal predecessors, (657), 107 states have call successors, (107), 44 states have call predecessors, (107), 44 states have return successors, (106), 105 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-03 14:28:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 870 transitions. [2025-03-03 14:28:20,165 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 870 transitions. Word has length 133 [2025-03-03 14:28:20,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:20,165 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 870 transitions. [2025-03-03 14:28:20,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:28:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 870 transitions. [2025-03-03 14:28:20,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 14:28:20,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:20,168 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:20,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:28:20,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:20,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:20,170 INFO L85 PathProgramCache]: Analyzing trace with hash 51914971, now seen corresponding path program 1 times [2025-03-03 14:28:20,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:20,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851986772] [2025-03-03 14:28:20,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:20,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:20,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 14:28:20,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 14:28:20,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:20,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:20,266 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-03 14:28:20,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:20,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851986772] [2025-03-03 14:28:20,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851986772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:20,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:20,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:28:20,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67319124] [2025-03-03 14:28:20,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:20,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:28:20,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:20,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:28:20,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:28:20,268 INFO L87 Difference]: Start difference. First operand 595 states and 870 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:28:20,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:20,311 INFO L93 Difference]: Finished difference Result 1159 states and 1710 transitions. [2025-03-03 14:28:20,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:28:20,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 149 [2025-03-03 14:28:20,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:20,315 INFO L225 Difference]: With dead ends: 1159 [2025-03-03 14:28:20,315 INFO L226 Difference]: Without dead ends: 594 [2025-03-03 14:28:20,317 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-03 14:28:20,317 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 832 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:20,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 891 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:20,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-03 14:28:20,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2025-03-03 14:28:20,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 443 states have (on average 1.4785553047404063) internal successors, (655), 459 states have internal predecessors, (655), 106 states have call successors, (106), 44 states have call predecessors, (106), 44 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-03 14:28:20,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 866 transitions. [2025-03-03 14:28:20,370 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 866 transitions. Word has length 149 [2025-03-03 14:28:20,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:20,371 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 866 transitions. [2025-03-03 14:28:20,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:28:20,371 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 866 transitions. [2025-03-03 14:28:20,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 14:28:20,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:20,373 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:20,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:28:20,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:20,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:20,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1093234452, now seen corresponding path program 1 times [2025-03-03 14:28:20,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:20,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49354361] [2025-03-03 14:28:20,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:20,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:20,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 14:28:20,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 14:28:20,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:20,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:20,469 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-03 14:28:20,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:20,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49354361] [2025-03-03 14:28:20,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49354361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:20,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:20,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:28:20,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465804805] [2025-03-03 14:28:20,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:20,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:28:20,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:20,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:28:20,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:28:20,471 INFO L87 Difference]: Start difference. First operand 594 states and 866 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-03 14:28:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:20,536 INFO L93 Difference]: Finished difference Result 1139 states and 1668 transitions. [2025-03-03 14:28:20,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:28:20,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 150 [2025-03-03 14:28:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:20,542 INFO L225 Difference]: With dead ends: 1139 [2025-03-03 14:28:20,542 INFO L226 Difference]: Without dead ends: 591 [2025-03-03 14:28:20,544 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-03 14:28:20,544 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 804 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:20,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 868 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-03 14:28:20,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-03-03 14:28:20,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 443 states have (on average 1.4537246049661399) internal successors, (644), 454 states have internal predecessors, (644), 103 states have call successors, (103), 44 states have call predecessors, (103), 44 states have return successors, (102), 101 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 14:28:20,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 849 transitions. [2025-03-03 14:28:20,578 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 849 transitions. Word has length 150 [2025-03-03 14:28:20,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:20,579 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 849 transitions. [2025-03-03 14:28:20,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-03 14:28:20,579 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 849 transitions. [2025-03-03 14:28:20,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 14:28:20,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:20,582 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:20,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:28:20,582 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:20,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:20,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1548638231, now seen corresponding path program 1 times [2025-03-03 14:28:20,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:20,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590416551] [2025-03-03 14:28:20,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:20,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:20,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 14:28:20,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 14:28:20,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:20,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 14:28:20,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:20,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590416551] [2025-03-03 14:28:20,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590416551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:28:20,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687801270] [2025-03-03 14:28:20,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:20,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:28:20,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:28:20,842 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-03 14:28:20,844 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-03 14:28:21,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 14:28:21,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 14:28:21,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:21,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:21,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 1414 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:28:21,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:28:21,222 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-03 14:28:21,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:28:21,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687801270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:21,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:28:21,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-03 14:28:21,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245380714] [2025-03-03 14:28:21,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:21,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:28:21,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:21,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:28:21,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:28:21,224 INFO L87 Difference]: Start difference. First operand 591 states and 849 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:28:21,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:21,256 INFO L93 Difference]: Finished difference Result 917 states and 1299 transitions. [2025-03-03 14:28:21,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:28:21,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 175 [2025-03-03 14:28:21,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:21,261 INFO L225 Difference]: With dead ends: 917 [2025-03-03 14:28:21,261 INFO L226 Difference]: Without dead ends: 593 [2025-03-03 14:28:21,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 175 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-03 14:28:21,263 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 0 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1690 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-03 14:28:21,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1690 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:21,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-03 14:28:21,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2025-03-03 14:28:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 445 states have (on average 1.451685393258427) internal successors, (646), 456 states have internal predecessors, (646), 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-03 14:28:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 851 transitions. [2025-03-03 14:28:21,292 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 851 transitions. Word has length 175 [2025-03-03 14:28:21,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:21,292 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 851 transitions. [2025-03-03 14:28:21,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:28:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 851 transitions. [2025-03-03 14:28:21,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 14:28:21,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:21,295 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:21,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:28:21,496 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-03 14:28:21,496 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:21,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:21,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1807429373, now seen corresponding path program 1 times [2025-03-03 14:28:21,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:21,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778927832] [2025-03-03 14:28:21,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:21,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:21,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 14:28:21,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 14:28:21,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:21,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-03 14:28:21,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:21,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778927832] [2025-03-03 14:28:21,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778927832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:28:21,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830462735] [2025-03-03 14:28:21,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:21,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:28:21,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:28:21,738 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-03 14:28:21,739 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-03 14:28:21,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 14:28:22,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 14:28:22,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:22,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:22,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 1398 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:28:22,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:28:22,089 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-03 14:28:22,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:28:22,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830462735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:22,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:28:22,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-03 14:28:22,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812686712] [2025-03-03 14:28:22,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:22,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:28:22,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:22,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:28:22,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:28:22,093 INFO L87 Difference]: Start difference. First operand 593 states and 851 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (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-03 14:28:22,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:22,130 INFO L93 Difference]: Finished difference Result 1205 states and 1762 transitions. [2025-03-03 14:28:22,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:28:22,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (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 175 [2025-03-03 14:28:22,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:22,136 INFO L225 Difference]: With dead ends: 1205 [2025-03-03 14:28:22,136 INFO L226 Difference]: Without dead ends: 690 [2025-03-03 14:28:22,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 175 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-03 14:28:22,139 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 165 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:22,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1660 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:22,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-03-03 14:28:22,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 682. [2025-03-03 14:28:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 520 states have (on average 1.4673076923076922) internal successors, (763), 531 states have internal predecessors, (763), 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-03 14:28:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 996 transitions. [2025-03-03 14:28:22,175 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 996 transitions. Word has length 175 [2025-03-03 14:28:22,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:22,176 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 996 transitions. [2025-03-03 14:28:22,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (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-03 14:28:22,176 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 996 transitions. [2025-03-03 14:28:22,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 14:28:22,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:22,179 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:22,188 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-03 14:28:22,379 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-03 14:28:22,380 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:22,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:22,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1223846041, now seen corresponding path program 1 times [2025-03-03 14:28:22,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:22,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631216692] [2025-03-03 14:28:22,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:22,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:22,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 14:28:22,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 14:28:22,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:22,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:22,610 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-03 14:28:22,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:22,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631216692] [2025-03-03 14:28:22,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631216692] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:28:22,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382399745] [2025-03-03 14:28:22,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:22,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:28:22,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:28:22,613 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-03 14:28:22,615 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-03 14:28:22,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 14:28:22,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 14:28:22,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:22,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:22,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 1433 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 14:28:22,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:28:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 14:28:23,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:28:23,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382399745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:23,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:28:23,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-03 14:28:23,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379391020] [2025-03-03 14:28:23,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:23,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:28:23,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:23,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:28:23,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:28:23,063 INFO L87 Difference]: Start difference. First operand 682 states and 996 transitions. Second operand has 8 states, 6 states have (on average 18.166666666666668) internal successors, (109), 8 states have internal predecessors, (109), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:28:23,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:23,192 INFO L93 Difference]: Finished difference Result 1311 states and 1929 transitions. [2025-03-03 14:28:23,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:28:23,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 18.166666666666668) internal successors, (109), 8 states have internal predecessors, (109), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 183 [2025-03-03 14:28:23,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:23,197 INFO L225 Difference]: With dead ends: 1311 [2025-03-03 14:28:23,197 INFO L226 Difference]: Without dead ends: 684 [2025-03-03 14:28:23,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 178 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-03 14:28:23,200 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 4 mSDsluCounter, 4999 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5835 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:23,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5835 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:28:23,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-03 14:28:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2025-03-03 14:28:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 521 states have (on average 1.4664107485604607) internal successors, (764), 533 states have internal predecessors, (764), 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-03 14:28:23,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 999 transitions. [2025-03-03 14:28:23,237 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 999 transitions. Word has length 183 [2025-03-03 14:28:23,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:23,237 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 999 transitions. [2025-03-03 14:28:23,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 18.166666666666668) internal successors, (109), 8 states have internal predecessors, (109), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:28:23,238 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 999 transitions. [2025-03-03 14:28:23,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 14:28:23,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:23,240 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:23,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:28:23,441 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-03 14:28:23,441 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:23,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:23,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1255924977, now seen corresponding path program 1 times [2025-03-03 14:28:23,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:23,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849804420] [2025-03-03 14:28:23,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:23,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:23,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 14:28:23,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 14:28:23,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:23,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:23,608 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-03 14:28:23,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:23,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849804420] [2025-03-03 14:28:23,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849804420] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:28:23,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496181268] [2025-03-03 14:28:23,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:23,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:28:23,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:28:23,610 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-03 14:28:23,612 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-03 14:28:23,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 14:28:23,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 14:28:23,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:23,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:23,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 1404 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:28:23,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:28:23,967 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 14:28:23,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:28:23,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496181268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:23,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:28:23,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-03 14:28:23,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810881139] [2025-03-03 14:28:23,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:23,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:28:23,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:23,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:28:23,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:28:23,970 INFO L87 Difference]: Start difference. First operand 684 states and 999 transitions. Second operand has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 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-03 14:28:24,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:24,068 INFO L93 Difference]: Finished difference Result 1312 states and 1933 transitions. [2025-03-03 14:28:24,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:28:24,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 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 177 [2025-03-03 14:28:24,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:24,072 INFO L225 Difference]: With dead ends: 1312 [2025-03-03 14:28:24,072 INFO L226 Difference]: Without dead ends: 686 [2025-03-03 14:28:24,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 174 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-03 14:28:24,076 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 2 mSDsluCounter, 3327 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4163 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:24,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4163 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-03-03 14:28:24,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2025-03-03 14:28:24,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 522 states have (on average 1.4655172413793103) internal successors, (765), 535 states have internal predecessors, (765), 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-03 14:28:24,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1005 transitions. [2025-03-03 14:28:24,105 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1005 transitions. Word has length 177 [2025-03-03 14:28:24,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:24,106 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 1005 transitions. [2025-03-03 14:28:24,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 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-03 14:28:24,107 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1005 transitions. [2025-03-03 14:28:24,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 14:28:24,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:24,109 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:24,118 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-03 14:28:24,314 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-03 14:28:24,314 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:24,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:24,314 INFO L85 PathProgramCache]: Analyzing trace with hash -58571882, now seen corresponding path program 1 times [2025-03-03 14:28:24,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:24,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777722046] [2025-03-03 14:28:24,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:24,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:24,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 14:28:24,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 14:28:24,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:24,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-03 14:28:24,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:24,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777722046] [2025-03-03 14:28:24,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777722046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:24,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:24,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:28:24,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079821128] [2025-03-03 14:28:24,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:24,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:28:24,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:24,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:28:24,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:28:24,494 INFO L87 Difference]: Start difference. First operand 686 states and 1005 transitions. Second operand has 8 states, 6 states have (on average 17.0) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-03 14:28:24,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:24,574 INFO L93 Difference]: Finished difference Result 1300 states and 1920 transitions. [2025-03-03 14:28:24,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:28:24,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 17.0) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 178 [2025-03-03 14:28:24,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:24,579 INFO L225 Difference]: With dead ends: 1300 [2025-03-03 14:28:24,579 INFO L226 Difference]: Without dead ends: 686 [2025-03-03 14:28:24,581 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-03 14:28:24,581 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 4 mSDsluCounter, 5005 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5842 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:24,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5842 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:24,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-03-03 14:28:24,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2025-03-03 14:28:24,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 522 states have (on average 1.4655172413793103) internal successors, (765), 535 states have internal predecessors, (765), 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-03 14:28:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1004 transitions. [2025-03-03 14:28:24,605 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1004 transitions. Word has length 178 [2025-03-03 14:28:24,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:24,605 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 1004 transitions. [2025-03-03 14:28:24,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 17.0) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-03 14:28:24,605 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1004 transitions. [2025-03-03 14:28:24,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-03 14:28:24,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:24,607 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:24,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:28:24,608 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:24,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:24,608 INFO L85 PathProgramCache]: Analyzing trace with hash -824215950, now seen corresponding path program 1 times [2025-03-03 14:28:24,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:24,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676952156] [2025-03-03 14:28:24,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:24,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:24,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 14:28:24,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 14:28:24,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:24,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:24,800 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-03 14:28:24,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:24,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676952156] [2025-03-03 14:28:24,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676952156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:24,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:24,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:28:24,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023725032] [2025-03-03 14:28:24,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:24,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:28:24,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:24,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:28:24,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:28:24,802 INFO L87 Difference]: Start difference. First operand 686 states and 1004 transitions. Second operand has 8 states, 6 states have (on average 18.0) internal successors, (108), 8 states have internal predecessors, (108), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:28:24,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:24,884 INFO L93 Difference]: Finished difference Result 1302 states and 1923 transitions. [2025-03-03 14:28:24,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:28:24,884 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 18.0) internal successors, (108), 8 states have internal predecessors, (108), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 186 [2025-03-03 14:28:24,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:24,888 INFO L225 Difference]: With dead ends: 1302 [2025-03-03 14:28:24,889 INFO L226 Difference]: Without dead ends: 688 [2025-03-03 14:28:24,890 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-03 14:28:24,890 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 3 mSDsluCounter, 5010 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5848 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:24,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5848 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-03 14:28:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2025-03-03 14:28:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 523 states have (on average 1.4646271510516253) internal successors, (766), 537 states have internal predecessors, (766), 117 states have call successors, (117), 44 states have call predecessors, (117), 47 states have return successors, (124), 115 states have call predecessors, (124), 116 states have call successors, (124) [2025-03-03 14:28:24,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1007 transitions. [2025-03-03 14:28:24,913 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1007 transitions. Word has length 186 [2025-03-03 14:28:24,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:24,914 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1007 transitions. [2025-03-03 14:28:24,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 18.0) internal successors, (108), 8 states have internal predecessors, (108), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:28:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1007 transitions. [2025-03-03 14:28:24,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 14:28:24,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:24,916 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:24,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:28:24,916 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:24,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:24,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1027945901, now seen corresponding path program 1 times [2025-03-03 14:28:24,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:24,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609358926] [2025-03-03 14:28:24,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:24,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:24,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 14:28:24,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 14:28:24,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:24,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-03 14:28:25,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:25,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609358926] [2025-03-03 14:28:25,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609358926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:25,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:25,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:28:25,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298620248] [2025-03-03 14:28:25,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:25,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:28:25,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:25,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:28:25,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:28:25,051 INFO L87 Difference]: Start difference. First operand 688 states and 1007 transitions. Second operand has 9 states, 7 states have (on average 15.285714285714286) internal successors, (107), 8 states have internal predecessors, (107), 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-03 14:28:25,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:25,191 INFO L93 Difference]: Finished difference Result 1299 states and 1917 transitions. [2025-03-03 14:28:25,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:28:25,191 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 15.285714285714286) internal successors, (107), 8 states have internal predecessors, (107), 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 180 [2025-03-03 14:28:25,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:25,197 INFO L225 Difference]: With dead ends: 1299 [2025-03-03 14:28:25,198 INFO L226 Difference]: Without dead ends: 688 [2025-03-03 14:28:25,199 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-03 14:28:25,199 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 7 mSDsluCounter, 5780 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6610 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-03 14:28:25,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6610 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:28:25,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-03 14:28:25,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2025-03-03 14:28:25,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 523 states have (on average 1.4646271510516253) internal successors, (766), 537 states have internal predecessors, (766), 117 states have call successors, (117), 44 states have call predecessors, (117), 47 states have return successors, (123), 115 states have call predecessors, (123), 116 states have call successors, (123) [2025-03-03 14:28:25,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1006 transitions. [2025-03-03 14:28:25,247 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1006 transitions. Word has length 180 [2025-03-03 14:28:25,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:25,248 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1006 transitions. [2025-03-03 14:28:25,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 15.285714285714286) internal successors, (107), 8 states have internal predecessors, (107), 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-03 14:28:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1006 transitions. [2025-03-03 14:28:25,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-03 14:28:25,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:25,252 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-03 14:28:25,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:28:25,252 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:25,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:25,252 INFO L85 PathProgramCache]: Analyzing trace with hash -52723267, now seen corresponding path program 1 times [2025-03-03 14:28:25,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:25,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716872387] [2025-03-03 14:28:25,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:25,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:25,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-03 14:28:25,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-03 14:28:25,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:25,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:25,396 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-03 14:28:25,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:25,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716872387] [2025-03-03 14:28:25,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716872387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:25,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:25,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:28:25,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557055326] [2025-03-03 14:28:25,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:25,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:28:25,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:25,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:28:25,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:28:25,399 INFO L87 Difference]: Start difference. First operand 688 states and 1006 transitions. Second operand has 9 states, 7 states have (on average 16.142857142857142) internal successors, (113), 8 states have internal predecessors, (113), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:28:25,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:25,529 INFO L93 Difference]: Finished difference Result 1301 states and 1923 transitions. [2025-03-03 14:28:25,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:28:25,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 16.142857142857142) internal successors, (113), 8 states have internal predecessors, (113), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 188 [2025-03-03 14:28:25,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:25,534 INFO L225 Difference]: With dead ends: 1301 [2025-03-03 14:28:25,535 INFO L226 Difference]: Without dead ends: 690 [2025-03-03 14:28:25,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:28:25,538 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 4 mSDsluCounter, 5794 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6626 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:25,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6626 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:28:25,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-03-03 14:28:25,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2025-03-03 14:28:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 524 states have (on average 1.463740458015267) internal successors, (767), 539 states have internal predecessors, (767), 117 states have call successors, (117), 44 states have call predecessors, (117), 48 states have return successors, (128), 115 states have call predecessors, (128), 116 states have call successors, (128) [2025-03-03 14:28:25,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1012 transitions. [2025-03-03 14:28:25,566 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1012 transitions. Word has length 188 [2025-03-03 14:28:25,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:25,566 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1012 transitions. [2025-03-03 14:28:25,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 16.142857142857142) internal successors, (113), 8 states have internal predecessors, (113), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:28:25,567 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1012 transitions. [2025-03-03 14:28:25,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 14:28:25,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:25,569 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:25,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:28:25,569 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:25,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:25,570 INFO L85 PathProgramCache]: Analyzing trace with hash -391058120, now seen corresponding path program 1 times [2025-03-03 14:28:25,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:25,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019619350] [2025-03-03 14:28:25,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:25,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:25,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 14:28:25,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 14:28:25,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:25,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:25,692 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-03 14:28:25,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:25,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019619350] [2025-03-03 14:28:25,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019619350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:25,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:25,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:28:25,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127921724] [2025-03-03 14:28:25,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:25,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:28:25,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:25,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:28:25,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:28:25,694 INFO L87 Difference]: Start difference. First operand 690 states and 1012 transitions. Second operand has 6 states, 5 states have (on average 22.2) internal successors, (111), 6 states have internal predecessors, (111), 3 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-03 14:28:25,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:25,791 INFO L93 Difference]: Finished difference Result 1305 states and 1933 transitions. [2025-03-03 14:28:25,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:28:25,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.2) internal successors, (111), 6 states have internal predecessors, (111), 3 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 189 [2025-03-03 14:28:25,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:25,797 INFO L225 Difference]: With dead ends: 1305 [2025-03-03 14:28:25,797 INFO L226 Difference]: Without dead ends: 692 [2025-03-03 14:28:25,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:28:25,799 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 0 mSDsluCounter, 3327 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4163 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:25,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4163 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:28:25,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2025-03-03 14:28:25,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 690. [2025-03-03 14:28:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 524 states have (on average 1.463740458015267) internal successors, (767), 539 states have internal predecessors, (767), 117 states have call successors, (117), 44 states have call predecessors, (117), 48 states have return successors, (128), 115 states have call predecessors, (128), 116 states have call successors, (128) [2025-03-03 14:28:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1012 transitions. [2025-03-03 14:28:25,834 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1012 transitions. Word has length 189 [2025-03-03 14:28:25,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:25,834 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1012 transitions. [2025-03-03 14:28:25,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.2) internal successors, (111), 6 states have internal predecessors, (111), 3 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-03 14:28:25,834 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1012 transitions. [2025-03-03 14:28:25,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 14:28:25,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:25,837 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:25,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:28:25,837 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:25,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:25,838 INFO L85 PathProgramCache]: Analyzing trace with hash 180193113, now seen corresponding path program 1 times [2025-03-03 14:28:25,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:25,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005253806] [2025-03-03 14:28:25,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:25,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:25,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 14:28:25,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 14:28:25,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:25,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:28:25,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:25,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005253806] [2025-03-03 14:28:25,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005253806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:28:25,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915832565] [2025-03-03 14:28:25,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:25,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:28:25,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:28:25,959 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-03 14:28:25,960 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-03 14:28:26,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 14:28:26,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 14:28:26,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:26,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:26,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:28:26,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:28:26,269 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:28:26,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:28:26,374 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:28:26,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915832565] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:28:26,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:28:26,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 14:28:26,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961288453] [2025-03-03 14:28:26,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:28:26,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:28:26,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:26,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:28:26,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:28:26,376 INFO L87 Difference]: Start difference. First operand 690 states and 1012 transitions. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 14:28:26,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:26,538 INFO L93 Difference]: Finished difference Result 1572 states and 2379 transitions. [2025-03-03 14:28:26,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:28:26,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 189 [2025-03-03 14:28:26,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:26,546 INFO L225 Difference]: With dead ends: 1572 [2025-03-03 14:28:26,546 INFO L226 Difference]: Without dead ends: 1248 [2025-03-03 14:28:26,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:28:26,548 INFO L435 NwaCegarLoop]: 884 mSDtfsCounter, 938 mSDsluCounter, 2886 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 3770 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:26,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 3770 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:28:26,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2025-03-03 14:28:26,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1224. [2025-03-03 14:28:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 979 states have (on average 1.5178753830439224) internal successors, (1486), 994 states have internal predecessors, (1486), 196 states have call successors, (196), 44 states have call predecessors, (196), 48 states have return successors, (217), 194 states have call predecessors, (217), 195 states have call successors, (217) [2025-03-03 14:28:26,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1899 transitions. [2025-03-03 14:28:26,590 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1899 transitions. Word has length 189 [2025-03-03 14:28:26,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:26,592 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1899 transitions. [2025-03-03 14:28:26,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 14:28:26,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1899 transitions. [2025-03-03 14:28:26,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-03 14:28:26,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:26,596 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:26,604 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-03 14:28:26,800 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,SelfDestructingSolverStorable14 [2025-03-03 14:28:26,800 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:26,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:26,800 INFO L85 PathProgramCache]: Analyzing trace with hash -637904597, now seen corresponding path program 1 times [2025-03-03 14:28:26,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:26,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614150654] [2025-03-03 14:28:26,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:26,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:26,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 14:28:26,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 14:28:26,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:26,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:26,862 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:28:26,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:26,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614150654] [2025-03-03 14:28:26,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614150654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:26,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:26,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:28:26,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008319693] [2025-03-03 14:28:26,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:26,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:28:26,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:26,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:28:26,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:28:26,865 INFO L87 Difference]: Start difference. First operand 1224 states and 1899 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-03 14:28:26,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:26,930 INFO L93 Difference]: Finished difference Result 2819 states and 4444 transitions. [2025-03-03 14:28:26,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:28:26,930 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 186 [2025-03-03 14:28:26,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:26,938 INFO L225 Difference]: With dead ends: 2819 [2025-03-03 14:28:26,938 INFO L226 Difference]: Without dead ends: 1728 [2025-03-03 14:28:26,942 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-03 14:28:26,942 INFO L435 NwaCegarLoop]: 860 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, 1692 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:26,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1692 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:26,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-03-03 14:28:26,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1720. [2025-03-03 14:28:26,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1396 states have (on average 1.5308022922636104) internal successors, (2137), 1411 states have internal predecessors, (2137), 275 states have call successors, (275), 44 states have call predecessors, (275), 48 states have return successors, (306), 273 states have call predecessors, (306), 274 states have call successors, (306) [2025-03-03 14:28:26,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2718 transitions. [2025-03-03 14:28:26,995 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2718 transitions. Word has length 186 [2025-03-03 14:28:26,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:26,996 INFO L471 AbstractCegarLoop]: Abstraction has 1720 states and 2718 transitions. [2025-03-03 14:28:26,996 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-03 14:28:26,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2718 transitions. [2025-03-03 14:28:27,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-03 14:28:27,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:27,001 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:27,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:28:27,002 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:27,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:27,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2052338371, now seen corresponding path program 1 times [2025-03-03 14:28:27,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:27,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170456849] [2025-03-03 14:28:27,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:27,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:27,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 14:28:27,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 14:28:27,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:27,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:27,054 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:28:27,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:27,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170456849] [2025-03-03 14:28:27,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170456849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:27,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:27,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:28:27,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163460922] [2025-03-03 14:28:27,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:27,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:28:27,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:27,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:28:27,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:28:27,056 INFO L87 Difference]: Start difference. First operand 1720 states and 2718 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-03 14:28:27,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:27,106 INFO L93 Difference]: Finished difference Result 4055 states and 6474 transitions. [2025-03-03 14:28:27,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:28:27,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 187 [2025-03-03 14:28:27,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:27,118 INFO L225 Difference]: With dead ends: 4055 [2025-03-03 14:28:27,118 INFO L226 Difference]: Without dead ends: 2529 [2025-03-03 14:28:27,123 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-03 14:28:27,124 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 161 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1696 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-03 14:28:27,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1696 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2025-03-03 14:28:27,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2521. [2025-03-03 14:28:27,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2521 states, 2078 states have (on average 1.5442733397497594) internal successors, (3209), 2093 states have internal predecessors, (3209), 394 states have call successors, (394), 44 states have call predecessors, (394), 48 states have return successors, (425), 392 states have call predecessors, (425), 393 states have call successors, (425) [2025-03-03 14:28:27,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 4028 transitions. [2025-03-03 14:28:27,208 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 4028 transitions. Word has length 187 [2025-03-03 14:28:27,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:27,209 INFO L471 AbstractCegarLoop]: Abstraction has 2521 states and 4028 transitions. [2025-03-03 14:28:27,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-03 14:28:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 4028 transitions. [2025-03-03 14:28:27,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 14:28:27,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:27,219 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:27,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:28:27,219 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:27,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:27,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2104049699, now seen corresponding path program 1 times [2025-03-03 14:28:27,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:27,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512054183] [2025-03-03 14:28:27,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:27,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:27,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 14:28:27,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 14:28:27,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:27,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:27,281 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:28:27,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:27,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512054183] [2025-03-03 14:28:27,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512054183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:27,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:27,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:28:27,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308211373] [2025-03-03 14:28:27,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:27,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:28:27,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:27,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:28:27,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:28:27,283 INFO L87 Difference]: Start difference. First operand 2521 states and 4028 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:28:27,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:27,389 INFO L93 Difference]: Finished difference Result 5936 states and 9579 transitions. [2025-03-03 14:28:27,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:28:27,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 195 [2025-03-03 14:28:27,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:27,407 INFO L225 Difference]: With dead ends: 5936 [2025-03-03 14:28:27,407 INFO L226 Difference]: Without dead ends: 3763 [2025-03-03 14:28:27,414 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-03 14:28:27,414 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 159 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:27,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1681 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:27,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3763 states. [2025-03-03 14:28:27,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3763 to 3755. [2025-03-03 14:28:27,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3150 states have (on average 1.5555555555555556) internal successors, (4900), 3165 states have internal predecessors, (4900), 556 states have call successors, (556), 44 states have call predecessors, (556), 48 states have return successors, (603), 554 states have call predecessors, (603), 555 states have call successors, (603) [2025-03-03 14:28:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 6059 transitions. [2025-03-03 14:28:27,526 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 6059 transitions. Word has length 195 [2025-03-03 14:28:27,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:27,527 INFO L471 AbstractCegarLoop]: Abstraction has 3755 states and 6059 transitions. [2025-03-03 14:28:27,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:28:27,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 6059 transitions. [2025-03-03 14:28:27,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 14:28:27,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:27,537 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:27,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:28:27,537 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:27,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:27,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2070671778, now seen corresponding path program 1 times [2025-03-03 14:28:27,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:27,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109448693] [2025-03-03 14:28:27,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:27,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:27,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 14:28:27,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 14:28:27,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:27,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:28:27,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:27,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109448693] [2025-03-03 14:28:27,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109448693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:27,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:27,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:28:27,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241007117] [2025-03-03 14:28:27,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:27,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:28:27,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:27,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:28:27,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:28:27,591 INFO L87 Difference]: Start difference. First operand 3755 states and 6059 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-03 14:28:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:27,721 INFO L93 Difference]: Finished difference Result 8907 states and 14500 transitions. [2025-03-03 14:28:27,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:28:27,722 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 189 [2025-03-03 14:28:27,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:27,750 INFO L225 Difference]: With dead ends: 8907 [2025-03-03 14:28:27,750 INFO L226 Difference]: Without dead ends: 5755 [2025-03-03 14:28:27,761 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-03 14:28:27,762 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 157 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:27,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1681 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:27,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5755 states. [2025-03-03 14:28:27,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5755 to 5747. [2025-03-03 14:28:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5747 states, 4897 states have (on average 1.5650398202981417) internal successors, (7664), 4912 states have internal predecessors, (7664), 801 states have call successors, (801), 44 states have call predecessors, (801), 48 states have return successors, (874), 799 states have call predecessors, (874), 800 states have call successors, (874) [2025-03-03 14:28:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5747 states to 5747 states and 9339 transitions. [2025-03-03 14:28:27,944 INFO L78 Accepts]: Start accepts. Automaton has 5747 states and 9339 transitions. Word has length 189 [2025-03-03 14:28:27,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:27,944 INFO L471 AbstractCegarLoop]: Abstraction has 5747 states and 9339 transitions. [2025-03-03 14:28:27,945 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-03 14:28:27,945 INFO L276 IsEmpty]: Start isEmpty. Operand 5747 states and 9339 transitions. [2025-03-03 14:28:27,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 14:28:27,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:27,956 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:27,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:28:27,957 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:27,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:27,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1440447245, now seen corresponding path program 1 times [2025-03-03 14:28:27,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:27,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334677037] [2025-03-03 14:28:27,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:27,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:27,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 14:28:27,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 14:28:27,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:27,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:28,006 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:28:28,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:28,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334677037] [2025-03-03 14:28:28,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334677037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:28,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:28,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:28:28,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056733586] [2025-03-03 14:28:28,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:28,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:28:28,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:28,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:28:28,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:28:28,007 INFO L87 Difference]: Start difference. First operand 5747 states and 9339 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:28:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:28,274 INFO L93 Difference]: Finished difference Result 13844 states and 22642 transitions. [2025-03-03 14:28:28,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:28:28,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2025-03-03 14:28:28,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:28,313 INFO L225 Difference]: With dead ends: 13844 [2025-03-03 14:28:28,313 INFO L226 Difference]: Without dead ends: 9091 [2025-03-03 14:28:28,332 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-03 14:28:28,332 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 155 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1698 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-03 14:28:28,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1698 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:28,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9091 states. [2025-03-03 14:28:28,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9091 to 9083. [2025-03-03 14:28:28,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9083 states, 7740 states have (on average 1.5631782945736434) internal successors, (12099), 7755 states have internal predecessors, (12099), 1294 states have call successors, (1294), 44 states have call predecessors, (1294), 48 states have return successors, (1411), 1292 states have call predecessors, (1411), 1293 states have call successors, (1411) [2025-03-03 14:28:28,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9083 states to 9083 states and 14804 transitions. [2025-03-03 14:28:28,697 INFO L78 Accepts]: Start accepts. Automaton has 9083 states and 14804 transitions. Word has length 190 [2025-03-03 14:28:28,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:28,698 INFO L471 AbstractCegarLoop]: Abstraction has 9083 states and 14804 transitions. [2025-03-03 14:28:28,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:28:28,698 INFO L276 IsEmpty]: Start isEmpty. Operand 9083 states and 14804 transitions. [2025-03-03 14:28:28,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 14:28:28,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:28,747 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:28,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:28:28,747 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:28,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:28,747 INFO L85 PathProgramCache]: Analyzing trace with hash 326263809, now seen corresponding path program 1 times [2025-03-03 14:28:28,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:28,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190006459] [2025-03-03 14:28:28,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:28,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:28,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 14:28:28,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 14:28:28,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:28,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:28:28,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:28,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190006459] [2025-03-03 14:28:28,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190006459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:28,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:28,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:28:28,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542672173] [2025-03-03 14:28:28,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:28,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:28:28,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:28,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:28:28,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:28:28,803 INFO L87 Difference]: Start difference. First operand 9083 states and 14804 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:28:29,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:29,046 INFO L93 Difference]: Finished difference Result 22692 states and 37302 transitions. [2025-03-03 14:28:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:28:29,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 191 [2025-03-03 14:28:29,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:29,097 INFO L225 Difference]: With dead ends: 22692 [2025-03-03 14:28:29,097 INFO L226 Difference]: Without dead ends: 15093 [2025-03-03 14:28:29,125 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-03 14:28:29,126 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 153 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 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-03 14:28:29,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1686 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:29,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15093 states. [2025-03-03 14:28:29,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15093 to 15085. [2025-03-03 14:28:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15085 states, 12920 states have (on average 1.5695820433436531) internal successors, (20279), 12935 states have internal predecessors, (20279), 2116 states have call successors, (2116), 44 states have call predecessors, (2116), 48 states have return successors, (2311), 2114 states have call predecessors, (2311), 2115 states have call successors, (2311) [2025-03-03 14:28:29,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15085 states to 15085 states and 24706 transitions. [2025-03-03 14:28:29,615 INFO L78 Accepts]: Start accepts. Automaton has 15085 states and 24706 transitions. Word has length 191 [2025-03-03 14:28:29,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:29,616 INFO L471 AbstractCegarLoop]: Abstraction has 15085 states and 24706 transitions. [2025-03-03 14:28:29,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:28:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 15085 states and 24706 transitions. [2025-03-03 14:28:29,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-03 14:28:29,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:29,692 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:29,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:28:29,692 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:29,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:29,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1790479807, now seen corresponding path program 1 times [2025-03-03 14:28:29,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:29,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038537523] [2025-03-03 14:28:29,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:29,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:29,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-03 14:28:29,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-03 14:28:29,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:29,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:28:29,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:29,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038537523] [2025-03-03 14:28:29,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038537523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:29,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:29,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:28:29,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202273448] [2025-03-03 14:28:29,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:29,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:28:29,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:29,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:28:29,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:28:29,741 INFO L87 Difference]: Start difference. First operand 15085 states and 24706 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:28:30,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:30,206 INFO L93 Difference]: Finished difference Result 36299 states and 59203 transitions. [2025-03-03 14:28:30,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:28:30,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 199 [2025-03-03 14:28:30,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:30,288 INFO L225 Difference]: With dead ends: 36299 [2025-03-03 14:28:30,288 INFO L226 Difference]: Without dead ends: 23825 [2025-03-03 14:28:30,322 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-03 14:28:30,323 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 151 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1676 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-03 14:28:30,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1676 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:30,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23825 states. [2025-03-03 14:28:31,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23825 to 23817. [2025-03-03 14:28:31,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23817 states, 20449 states have (on average 1.543351753141963) internal successors, (31560), 20464 states have internal predecessors, (31560), 3319 states have call successors, (3319), 44 states have call predecessors, (3319), 48 states have return successors, (3658), 3317 states have call predecessors, (3658), 3318 states have call successors, (3658) [2025-03-03 14:28:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23817 states to 23817 states and 38537 transitions. [2025-03-03 14:28:31,379 INFO L78 Accepts]: Start accepts. Automaton has 23817 states and 38537 transitions. Word has length 199 [2025-03-03 14:28:31,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:31,379 INFO L471 AbstractCegarLoop]: Abstraction has 23817 states and 38537 transitions. [2025-03-03 14:28:31,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:28:31,379 INFO L276 IsEmpty]: Start isEmpty. Operand 23817 states and 38537 transitions. [2025-03-03 14:28:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-03 14:28:31,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:31,405 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:31,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:28:31,405 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:31,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:31,405 INFO L85 PathProgramCache]: Analyzing trace with hash 971314272, now seen corresponding path program 1 times [2025-03-03 14:28:31,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:31,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441523567] [2025-03-03 14:28:31,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:31,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:31,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 14:28:31,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 14:28:31,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:31,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:28:31,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:31,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441523567] [2025-03-03 14:28:31,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441523567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:31,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:31,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:28:31,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440047169] [2025-03-03 14:28:31,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:31,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:28:31,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:31,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:28:31,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:28:31,457 INFO L87 Difference]: Start difference. First operand 23817 states and 38537 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) [2025-03-03 14:28:32,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:32,144 INFO L93 Difference]: Finished difference Result 62757 states and 101956 transitions. [2025-03-03 14:28:32,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:28:32,145 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 193 [2025-03-03 14:28:32,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:32,300 INFO L225 Difference]: With dead ends: 62757 [2025-03-03 14:28:32,300 INFO L226 Difference]: Without dead ends: 42355 [2025-03-03 14:28:32,342 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-03 14:28:32,342 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 149 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:32,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1685 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:32,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42355 states. [2025-03-03 14:28:33,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42355 to 42347. [2025-03-03 14:28:33,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42347 states, 36529 states have (on average 1.5438145035451285) internal successors, (56394), 36544 states have internal predecessors, (56394), 5769 states have call successors, (5769), 44 states have call predecessors, (5769), 48 states have return successors, (6382), 5767 states have call predecessors, (6382), 5768 states have call successors, (6382) [2025-03-03 14:28:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42347 states to 42347 states and 68545 transitions. [2025-03-03 14:28:33,497 INFO L78 Accepts]: Start accepts. Automaton has 42347 states and 68545 transitions. Word has length 193 [2025-03-03 14:28:33,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:33,498 INFO L471 AbstractCegarLoop]: Abstraction has 42347 states and 68545 transitions. [2025-03-03 14:28:33,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2025-03-03 14:28:33,498 INFO L276 IsEmpty]: Start isEmpty. Operand 42347 states and 68545 transitions. [2025-03-03 14:28:33,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-03 14:28:33,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:33,522 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:33,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 14:28:33,522 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:33,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:33,523 INFO L85 PathProgramCache]: Analyzing trace with hash 587538848, now seen corresponding path program 1 times [2025-03-03 14:28:33,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:33,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241736301] [2025-03-03 14:28:33,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:33,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:33,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-03 14:28:33,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-03 14:28:33,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:33,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:28:33,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:33,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241736301] [2025-03-03 14:28:33,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241736301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:33,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:33,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:28:33,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120120219] [2025-03-03 14:28:33,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:33,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:28:33,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:33,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:28:33,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:28:33,696 INFO L87 Difference]: Start difference. First operand 42347 states and 68545 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:28:35,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:35,485 INFO L93 Difference]: Finished difference Result 114639 states and 186598 transitions. [2025-03-03 14:28:35,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:28:35,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 201 [2025-03-03 14:28:35,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:35,806 INFO L225 Difference]: With dead ends: 114639 [2025-03-03 14:28:35,806 INFO L226 Difference]: Without dead ends: 76874 [2025-03-03 14:28:35,892 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-03 14:28:35,893 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 147 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1695 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-03 14:28:35,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1695 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:35,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76874 states. [2025-03-03 14:28:38,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76874 to 76866. [2025-03-03 14:28:38,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76866 states, 66535 states have (on average 1.547952205606072) internal successors, (102993), 66550 states have internal predecessors, (102993), 10282 states have call successors, (10282), 44 states have call predecessors, (10282), 48 states have return successors, (11427), 10280 states have call predecessors, (11427), 10281 states have call successors, (11427) [2025-03-03 14:28:38,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76866 states to 76866 states and 124702 transitions. [2025-03-03 14:28:38,333 INFO L78 Accepts]: Start accepts. Automaton has 76866 states and 124702 transitions. Word has length 201 [2025-03-03 14:28:38,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:38,334 INFO L471 AbstractCegarLoop]: Abstraction has 76866 states and 124702 transitions. [2025-03-03 14:28:38,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:28:38,334 INFO L276 IsEmpty]: Start isEmpty. Operand 76866 states and 124702 transitions. [2025-03-03 14:28:38,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-03 14:28:38,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:38,363 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:38,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 14:28:38,363 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:38,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:38,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1631552304, now seen corresponding path program 1 times [2025-03-03 14:28:38,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:38,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778521646] [2025-03-03 14:28:38,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:38,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:38,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 14:28:38,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 14:28:38,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:38,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:38,419 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:28:38,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:38,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778521646] [2025-03-03 14:28:38,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778521646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:38,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:38,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:28:38,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379903884] [2025-03-03 14:28:38,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:38,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:28:38,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:38,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:28:38,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:28:38,420 INFO L87 Difference]: Start difference. First operand 76866 states and 124702 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:28:40,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:40,978 INFO L93 Difference]: Finished difference Result 143590 states and 233780 transitions. [2025-03-03 14:28:40,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:28:40,978 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 202 [2025-03-03 14:28:40,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:41,442 INFO L225 Difference]: With dead ends: 143590 [2025-03-03 14:28:41,442 INFO L226 Difference]: Without dead ends: 143266 [2025-03-03 14:28:41,502 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-03 14:28:41,502 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 141 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:41,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1692 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:41,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143266 states. [2025-03-03 14:28:45,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143266 to 143258. [2025-03-03 14:28:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143258 states, 124559 states have (on average 1.5473871819780185) internal successors, (192741), 124574 states have internal predecessors, (192741), 18650 states have call successors, (18650), 44 states have call predecessors, (18650), 48 states have return successors, (20841), 18648 states have call predecessors, (20841), 18649 states have call successors, (20841) [2025-03-03 14:28:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143258 states to 143258 states and 232232 transitions. [2025-03-03 14:28:46,166 INFO L78 Accepts]: Start accepts. Automaton has 143258 states and 232232 transitions. Word has length 202 [2025-03-03 14:28:46,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:46,166 INFO L471 AbstractCegarLoop]: Abstraction has 143258 states and 232232 transitions. [2025-03-03 14:28:46,167 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:28:46,167 INFO L276 IsEmpty]: Start isEmpty. Operand 143258 states and 232232 transitions. [2025-03-03 14:28:46,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 14:28:46,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:46,210 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:46,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 14:28:46,211 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:46,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:46,211 INFO L85 PathProgramCache]: Analyzing trace with hash 339899152, now seen corresponding path program 1 times [2025-03-03 14:28:46,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:46,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832080672] [2025-03-03 14:28:46,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:46,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:46,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 14:28:46,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 14:28:46,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:46,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:46,606 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:28:46,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:46,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832080672] [2025-03-03 14:28:46,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832080672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:46,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:46,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 14:28:46,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987614252] [2025-03-03 14:28:46,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:46,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 14:28:46,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:46,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 14:28:46,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:28:46,608 INFO L87 Difference]: Start difference. First operand 143258 states and 232232 transitions. Second operand has 14 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 7 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2025-03-03 14:28:53,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:53,049 INFO L93 Difference]: Finished difference Result 285508 states and 468321 transitions. [2025-03-03 14:28:53,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 14:28:53,054 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 7 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 196 [2025-03-03 14:28:53,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:54,209 INFO L225 Difference]: With dead ends: 285508 [2025-03-03 14:28:54,210 INFO L226 Difference]: Without dead ends: 285190 [2025-03-03 14:28:54,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2025-03-03 14:28:54,323 INFO L435 NwaCegarLoop]: 1006 mSDtfsCounter, 2102 mSDsluCounter, 9891 mSDsCounter, 0 mSdLazyCounter, 2250 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2102 SdHoareTripleChecker+Valid, 10897 SdHoareTripleChecker+Invalid, 3014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:54,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2102 Valid, 10897 Invalid, 3014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2250 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 14:28:54,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285190 states.