./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec7_product34.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec7_product34.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f7b52dfa978a30892cebb35c28a84cc12db47d20591a31b18d58060a0678455 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:56:33,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:56:33,078 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:56:33,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:56:33,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:56:33,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:56:33,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:56:33,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:56:33,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:56:33,114 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:56:33,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:56:33,116 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:56:33,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:56:33,116 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:56:33,116 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:56:33,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:56:33,117 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:56:33,117 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:56:33,117 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:56:33,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:56:33,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:56:33,118 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:56:33,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:56:33,118 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:56:33,118 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:56:33,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:56:33,118 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:56:33,118 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:56:33,118 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:56:33,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:56:33,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:56:33,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:56:33,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:56:33,119 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:56:33,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:56:33,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:56:33,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:56:33,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:56:33,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:56:33,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:56:33,120 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:56:33,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:56:33,120 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:56:33,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:56:33,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:56:33,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:56:33,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:56:33,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:56:33,120 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5f7b52dfa978a30892cebb35c28a84cc12db47d20591a31b18d58060a0678455 [2025-01-09 03:56:33,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:56:33,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:56:33,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:56:33,420 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:56:33,420 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:56:33,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec7_product34.cil.c [2025-01-09 03:56:34,709 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6015459d8/04f45dcc2cdc4e3185f823513faa6c08/FLAG97b068bdd [2025-01-09 03:56:35,085 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:56:35,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product34.cil.c [2025-01-09 03:56:35,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6015459d8/04f45dcc2cdc4e3185f823513faa6c08/FLAG97b068bdd [2025-01-09 03:56:35,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6015459d8/04f45dcc2cdc4e3185f823513faa6c08 [2025-01-09 03:56:35,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:56:35,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:56:35,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:56:35,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:56:35,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:56:35,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:56:35" (1/1) ... [2025-01-09 03:56:35,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f16c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:35, skipping insertion in model container [2025-01-09 03:56:35,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:56:35" (1/1) ... [2025-01-09 03:56:35,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:56:35,689 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product34.cil.c[10988,11001] [2025-01-09 03:56:35,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:56:35,995 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:56:36,004 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-01-09 03:56:36,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [380] [2025-01-09 03:56:36,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [528] [2025-01-09 03:56:36,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [547] [2025-01-09 03:56:36,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [556] [2025-01-09 03:56:36,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [922] [2025-01-09 03:56:36,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1324] [2025-01-09 03:56:36,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1359] [2025-01-09 03:56:36,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2428] [2025-01-09 03:56:36,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2445] [2025-01-09 03:56:36,011 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2842] [2025-01-09 03:56:36,036 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product34.cil.c[10988,11001] [2025-01-09 03:56:36,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:56:36,166 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:56:36,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:36 WrapperNode [2025-01-09 03:56:36,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:56:36,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:56:36,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:56:36,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:56:36,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:36" (1/1) ... [2025-01-09 03:56:36,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:36" (1/1) ... [2025-01-09 03:56:36,258 INFO L138 Inliner]: procedures = 134, calls = 218, calls flagged for inlining = 62, calls inlined = 59, statements flattened = 1089 [2025-01-09 03:56:36,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:56:36,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:56:36,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:56:36,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:56:36,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:36" (1/1) ... [2025-01-09 03:56:36,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:36" (1/1) ... [2025-01-09 03:56:36,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:36" (1/1) ... [2025-01-09 03:56:36,300 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-01-09 03:56:36,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:36" (1/1) ... [2025-01-09 03:56:36,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:36" (1/1) ... [2025-01-09 03:56:36,331 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:36" (1/1) ... [2025-01-09 03:56:36,337 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:36" (1/1) ... [2025-01-09 03:56:36,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:36" (1/1) ... [2025-01-09 03:56:36,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:36" (1/1) ... [2025-01-09 03:56:36,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:36" (1/1) ... [2025-01-09 03:56:36,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:56:36,385 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:56:36,385 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:56:36,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:56:36,386 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:36" (1/1) ... [2025-01-09 03:56:36,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:56:36,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:36,419 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:56:36,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:56:36,450 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:56:36,451 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:56:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-01-09 03:56:36,451 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-01-09 03:56:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:56:36,452 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:56:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-01-09 03:56:36,452 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-01-09 03:56:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:56:36,453 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:56:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:56:36,453 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:56:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:56:36,453 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:56:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:56:36,453 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:56:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:56:36,454 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:56:36,454 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:56:36,455 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:56:36,456 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:56:36,456 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:56:36,456 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:56:36,456 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:56:36,456 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:56:36,456 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:56:36,456 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:56:36,456 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:56:36,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:56:36,456 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:56:36,456 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:56:36,456 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:56:36,456 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:56:36,456 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-01-09 03:56:36,456 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-01-09 03:56:36,456 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:56:36,456 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:56:36,456 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:56:36,456 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:56:36,456 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:56:36,456 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:56:36,456 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2025-01-09 03:56:36,456 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2025-01-09 03:56:36,456 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:56:36,456 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:56:36,456 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:56:36,457 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:56:36,457 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:56:36,457 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:56:36,457 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:56:36,457 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:56:36,457 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:56:36,457 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:56:36,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:56:36,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:56:36,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:56:36,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:56:36,457 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:56:36,457 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:56:36,457 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-01-09 03:56:36,457 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-01-09 03:56:36,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:56:36,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:56:36,687 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:56:36,691 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:56:37,834 INFO L? ?]: Removed 580 outVars from TransFormulas that were not future-live. [2025-01-09 03:56:37,834 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:56:37,866 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:56:37,866 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:56:37,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:56:37 BoogieIcfgContainer [2025-01-09 03:56:37,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:56:37,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:56:37,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:56:37,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:56:37,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:56:35" (1/3) ... [2025-01-09 03:56:37,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a590141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:56:37, skipping insertion in model container [2025-01-09 03:56:37,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:36" (2/3) ... [2025-01-09 03:56:37,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a590141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:56:37, skipping insertion in model container [2025-01-09 03:56:37,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:56:37" (3/3) ... [2025-01-09 03:56:37,881 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec7_product34.cil.c [2025-01-09 03:56:37,896 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:56:37,901 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec7_product34.cil.c that has 29 procedures, 443 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:56:38,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:56:38,029 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;@32136c37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:56:38,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:56:38,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 443 states, 343 states have (on average 1.5364431486880465) internal successors, (527), 348 states have internal predecessors, (527), 70 states have call successors, (70), 28 states have call predecessors, (70), 28 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 03:56:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 03:56:38,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:38,059 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:38,059 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:38,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:38,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1006080243, now seen corresponding path program 1 times [2025-01-09 03:56:38,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:38,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829522917] [2025-01-09 03:56:38,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:38,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:38,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 03:56:38,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 03:56:38,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:38,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:38,901 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 03:56:38,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:38,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829522917] [2025-01-09 03:56:38,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829522917] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:56:38,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159168706] [2025-01-09 03:56:38,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:38,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:38,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:38,905 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:56:38,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:56:39,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 03:56:39,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 03:56:39,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:39,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:39,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 1245 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:56:39,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:56:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:56:39,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:56:39,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159168706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:39,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:56:39,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:56:39,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696909859] [2025-01-09 03:56:39,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:39,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:39,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:39,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:39,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:56:39,438 INFO L87 Difference]: Start difference. First operand has 443 states, 343 states have (on average 1.5364431486880465) internal successors, (527), 348 states have internal predecessors, (527), 70 states have call successors, (70), 28 states have call predecessors, (70), 28 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:56:39,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:39,546 INFO L93 Difference]: Finished difference Result 696 states and 1030 transitions. [2025-01-09 03:56:39,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:39,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 148 [2025-01-09 03:56:39,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:39,564 INFO L225 Difference]: With dead ends: 696 [2025-01-09 03:56:39,564 INFO L226 Difference]: Without dead ends: 438 [2025-01-09 03:56:39,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:56:39,573 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 1 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:39,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1321 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:39,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-01-09 03:56:39,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 437. [2025-01-09 03:56:39,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 338 states have (on average 1.532544378698225) internal successors, (518), 342 states have internal predecessors, (518), 70 states have call successors, (70), 28 states have call predecessors, (70), 28 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 03:56:39,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 657 transitions. [2025-01-09 03:56:39,673 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 657 transitions. Word has length 148 [2025-01-09 03:56:39,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:39,675 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 657 transitions. [2025-01-09 03:56:39,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:56:39,676 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 657 transitions. [2025-01-09 03:56:39,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 03:56:39,684 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:39,684 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:39,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:56:39,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 03:56:39,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:39,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:39,887 INFO L85 PathProgramCache]: Analyzing trace with hash 536569063, now seen corresponding path program 1 times [2025-01-09 03:56:39,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:39,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920653651] [2025-01-09 03:56:39,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:39,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:39,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 03:56:39,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 03:56:39,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:39,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 03:56:40,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:40,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920653651] [2025-01-09 03:56:40,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920653651] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:56:40,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085047901] [2025-01-09 03:56:40,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:40,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:40,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:40,302 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:56:40,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:56:40,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 03:56:40,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 03:56:40,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:40,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:40,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:56:40,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:56:40,668 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:56:40,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:56:40,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085047901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:40,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:56:40,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:56:40,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149394609] [2025-01-09 03:56:40,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:40,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:40,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:40,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:40,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:56:40,673 INFO L87 Difference]: Start difference. First operand 437 states and 657 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:56:40,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:40,729 INFO L93 Difference]: Finished difference Result 922 states and 1406 transitions. [2025-01-09 03:56:40,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:40,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2025-01-09 03:56:40,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:40,737 INFO L225 Difference]: With dead ends: 922 [2025-01-09 03:56:40,737 INFO L226 Difference]: Without dead ends: 511 [2025-01-09 03:56:40,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:56:40,741 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 134 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:40,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1278 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:40,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-01-09 03:56:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 503. [2025-01-09 03:56:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 390 states have (on average 1.5538461538461539) internal successors, (606), 394 states have internal predecessors, (606), 84 states have call successors, (84), 28 states have call predecessors, (84), 28 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:56:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 773 transitions. [2025-01-09 03:56:40,811 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 773 transitions. Word has length 134 [2025-01-09 03:56:40,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:40,812 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 773 transitions. [2025-01-09 03:56:40,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:56:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 773 transitions. [2025-01-09 03:56:40,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 03:56:40,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:40,817 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:40,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:56:41,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:41,018 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:41,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:41,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1682036351, now seen corresponding path program 1 times [2025-01-09 03:56:41,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:41,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616247321] [2025-01-09 03:56:41,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:41,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:41,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 03:56:41,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 03:56:41,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:41,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:41,279 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 03:56:41,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:41,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616247321] [2025-01-09 03:56:41,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616247321] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:56:41,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298808898] [2025-01-09 03:56:41,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:41,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:41,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:41,283 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:56:41,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:56:41,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 03:56:41,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 03:56:41,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:41,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:41,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 1183 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:56:41,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:56:41,704 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 03:56:41,704 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:56:41,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298808898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:41,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:56:41,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:56:41,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166404584] [2025-01-09 03:56:41,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:41,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:56:41,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:41,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:56:41,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:56:41,709 INFO L87 Difference]: Start difference. First operand 503 states and 773 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:56:41,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:41,799 INFO L93 Difference]: Finished difference Result 997 states and 1536 transitions. [2025-01-09 03:56:41,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:56:41,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2025-01-09 03:56:41,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:41,806 INFO L225 Difference]: With dead ends: 997 [2025-01-09 03:56:41,806 INFO L226 Difference]: Without dead ends: 505 [2025-01-09 03:56:41,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:56:41,810 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 2 mSDsluCounter, 1933 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2581 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:41,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2581 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:41,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-01-09 03:56:41,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-01-09 03:56:41,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 391 states have (on average 1.5524296675191815) internal successors, (607), 396 states have internal predecessors, (607), 84 states have call successors, (84), 28 states have call predecessors, (84), 29 states have return successors, (85), 82 states have call predecessors, (85), 83 states have call successors, (85) [2025-01-09 03:56:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 776 transitions. [2025-01-09 03:56:41,847 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 776 transitions. Word has length 135 [2025-01-09 03:56:41,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:41,847 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 776 transitions. [2025-01-09 03:56:41,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:56:41,848 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 776 transitions. [2025-01-09 03:56:41,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 03:56:41,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:41,855 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:41,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:56:42,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:42,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:42,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:42,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1653067123, now seen corresponding path program 1 times [2025-01-09 03:56:42,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:42,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344380734] [2025-01-09 03:56:42,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:42,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:42,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 03:56:42,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 03:56:42,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:42,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 03:56:42,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:42,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344380734] [2025-01-09 03:56:42,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344380734] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:56:42,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056679413] [2025-01-09 03:56:42,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:42,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:42,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:42,290 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:56:42,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:56:42,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 03:56:42,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 03:56:42,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:42,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:42,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:56:42,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:56:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 03:56:42,724 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:56:42,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056679413] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:42,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:56:42,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:56:42,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068619062] [2025-01-09 03:56:42,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:42,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:56:42,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:42,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:56:42,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:56:42,727 INFO L87 Difference]: Start difference. First operand 505 states and 776 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:56:42,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:42,806 INFO L93 Difference]: Finished difference Result 999 states and 1541 transitions. [2025-01-09 03:56:42,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:56:42,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 136 [2025-01-09 03:56:42,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:42,811 INFO L225 Difference]: With dead ends: 999 [2025-01-09 03:56:42,812 INFO L226 Difference]: Without dead ends: 507 [2025-01-09 03:56:42,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:56:42,815 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 2 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2567 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:42,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2567 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:42,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-01-09 03:56:42,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-01-09 03:56:42,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 392 states have (on average 1.5510204081632653) internal successors, (608), 398 states have internal predecessors, (608), 84 states have call successors, (84), 28 states have call predecessors, (84), 30 states have return successors, (90), 82 states have call predecessors, (90), 83 states have call successors, (90) [2025-01-09 03:56:42,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 782 transitions. [2025-01-09 03:56:42,842 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 782 transitions. Word has length 136 [2025-01-09 03:56:42,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:42,843 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 782 transitions. [2025-01-09 03:56:42,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:56:42,843 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 782 transitions. [2025-01-09 03:56:42,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 03:56:42,847 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:42,847 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:42,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:56:43,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:43,048 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:43,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:43,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1646024005, now seen corresponding path program 1 times [2025-01-09 03:56:43,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:43,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005257164] [2025-01-09 03:56:43,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:43,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:43,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 03:56:43,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 03:56:43,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:43,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:43,246 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:56:43,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:43,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005257164] [2025-01-09 03:56:43,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005257164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:43,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:43,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:56:43,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365801379] [2025-01-09 03:56:43,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:43,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:56:43,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:43,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:56:43,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:56:43,248 INFO L87 Difference]: Start difference. First operand 507 states and 782 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 03:56:43,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:43,299 INFO L93 Difference]: Finished difference Result 991 states and 1532 transitions. [2025-01-09 03:56:43,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:56:43,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 156 [2025-01-09 03:56:43,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:43,304 INFO L225 Difference]: With dead ends: 991 [2025-01-09 03:56:43,304 INFO L226 Difference]: Without dead ends: 507 [2025-01-09 03:56:43,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:56:43,307 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 2 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2585 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:43,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2585 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:43,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-01-09 03:56:43,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-01-09 03:56:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 392 states have (on average 1.5510204081632653) internal successors, (608), 398 states have internal predecessors, (608), 84 states have call successors, (84), 28 states have call predecessors, (84), 30 states have return successors, (89), 82 states have call predecessors, (89), 83 states have call successors, (89) [2025-01-09 03:56:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 781 transitions. [2025-01-09 03:56:43,340 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 781 transitions. Word has length 156 [2025-01-09 03:56:43,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:43,341 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 781 transitions. [2025-01-09 03:56:43,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 03:56:43,341 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 781 transitions. [2025-01-09 03:56:43,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 03:56:43,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:43,344 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:43,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:56:43,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:43,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:43,345 INFO L85 PathProgramCache]: Analyzing trace with hash 471430648, now seen corresponding path program 1 times [2025-01-09 03:56:43,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:43,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028384606] [2025-01-09 03:56:43,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:43,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:43,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 03:56:43,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 03:56:43,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:43,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:43,524 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 03:56:43,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:43,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028384606] [2025-01-09 03:56:43,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028384606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:43,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:43,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:56:43,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475685652] [2025-01-09 03:56:43,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:43,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:56:43,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:43,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:56:43,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:56:43,526 INFO L87 Difference]: Start difference. First operand 507 states and 781 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:56:43,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:43,580 INFO L93 Difference]: Finished difference Result 993 states and 1535 transitions. [2025-01-09 03:56:43,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:56:43,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 138 [2025-01-09 03:56:43,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:43,587 INFO L225 Difference]: With dead ends: 993 [2025-01-09 03:56:43,587 INFO L226 Difference]: Without dead ends: 509 [2025-01-09 03:56:43,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:56:43,589 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 1 mSDsluCounter, 1938 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2588 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:43,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2588 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:43,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-01-09 03:56:43,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-01-09 03:56:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 393 states have (on average 1.549618320610687) internal successors, (609), 400 states have internal predecessors, (609), 84 states have call successors, (84), 28 states have call predecessors, (84), 31 states have return successors, (91), 82 states have call predecessors, (91), 83 states have call successors, (91) [2025-01-09 03:56:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 784 transitions. [2025-01-09 03:56:43,618 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 784 transitions. Word has length 138 [2025-01-09 03:56:43,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:43,618 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 784 transitions. [2025-01-09 03:56:43,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:56:43,618 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 784 transitions. [2025-01-09 03:56:43,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 03:56:43,622 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:43,622 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:43,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:56:43,623 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:43,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:43,624 INFO L85 PathProgramCache]: Analyzing trace with hash 269822998, now seen corresponding path program 1 times [2025-01-09 03:56:43,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:43,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534396533] [2025-01-09 03:56:43,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:43,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:43,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 03:56:43,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 03:56:43,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:43,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:43,842 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 03:56:43,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:43,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534396533] [2025-01-09 03:56:43,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534396533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:43,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:43,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:56:43,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887045325] [2025-01-09 03:56:43,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:43,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:56:43,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:43,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:56:43,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:56:43,845 INFO L87 Difference]: Start difference. First operand 509 states and 784 transitions. Second operand has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 03:56:43,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:43,977 INFO L93 Difference]: Finished difference Result 995 states and 1534 transitions. [2025-01-09 03:56:43,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:56:43,978 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 158 [2025-01-09 03:56:43,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:43,983 INFO L225 Difference]: With dead ends: 995 [2025-01-09 03:56:43,983 INFO L226 Difference]: Without dead ends: 511 [2025-01-09 03:56:43,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:56:43,986 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 7 mSDsluCounter, 3811 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4451 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:43,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4451 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:56:43,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-01-09 03:56:44,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-01-09 03:56:44,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 395 states have (on average 1.5468354430379747) internal successors, (611), 401 states have internal predecessors, (611), 84 states have call successors, (84), 29 states have call predecessors, (84), 31 states have return successors, (90), 82 states have call predecessors, (90), 83 states have call successors, (90) [2025-01-09 03:56:44,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 785 transitions. [2025-01-09 03:56:44,011 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 785 transitions. Word has length 158 [2025-01-09 03:56:44,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:44,012 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 785 transitions. [2025-01-09 03:56:44,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 03:56:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 785 transitions. [2025-01-09 03:56:44,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 03:56:44,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:44,015 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:44,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:56:44,016 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:44,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:44,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1218221717, now seen corresponding path program 2 times [2025-01-09 03:56:44,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:44,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854926106] [2025-01-09 03:56:44,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:56:44,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:44,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-01-09 03:56:44,065 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 03:56:44,066 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:56:44,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:44,228 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 03:56:44,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:44,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854926106] [2025-01-09 03:56:44,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854926106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:44,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:44,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:56:44,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445273543] [2025-01-09 03:56:44,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:44,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:56:44,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:44,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:56:44,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:56:44,231 INFO L87 Difference]: Start difference. First operand 511 states and 785 transitions. Second operand has 7 states, 6 states have (on average 15.666666666666666) internal successors, (94), 7 states have internal predecessors, (94), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 03:56:44,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:44,334 INFO L93 Difference]: Finished difference Result 995 states and 1538 transitions. [2025-01-09 03:56:44,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:56:44,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.666666666666666) internal successors, (94), 7 states have internal predecessors, (94), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 159 [2025-01-09 03:56:44,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:44,340 INFO L225 Difference]: With dead ends: 995 [2025-01-09 03:56:44,340 INFO L226 Difference]: Without dead ends: 513 [2025-01-09 03:56:44,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:56:44,345 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 2 mSDsluCounter, 3212 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3860 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:44,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3860 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:56:44,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-01-09 03:56:44,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2025-01-09 03:56:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 396 states have (on average 1.5454545454545454) internal successors, (612), 403 states have internal predecessors, (612), 84 states have call successors, (84), 29 states have call predecessors, (84), 32 states have return successors, (95), 82 states have call predecessors, (95), 83 states have call successors, (95) [2025-01-09 03:56:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 791 transitions. [2025-01-09 03:56:44,371 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 791 transitions. Word has length 159 [2025-01-09 03:56:44,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:44,371 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 791 transitions. [2025-01-09 03:56:44,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.666666666666666) internal successors, (94), 7 states have internal predecessors, (94), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 03:56:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 791 transitions. [2025-01-09 03:56:44,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 03:56:44,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:44,375 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:44,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:56:44,375 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:44,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:44,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1924554160, now seen corresponding path program 1 times [2025-01-09 03:56:44,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:44,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58277120] [2025-01-09 03:56:44,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:44,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:44,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 03:56:44,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 03:56:44,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:44,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:44,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:44,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58277120] [2025-01-09 03:56:44,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58277120] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:56:44,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123206978] [2025-01-09 03:56:44,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:44,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:44,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:44,546 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:56:44,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:56:44,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 03:56:44,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 03:56:44,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:44,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:44,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:56:44,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:56:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:44,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:56:45,037 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:45,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123206978] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:56:45,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:56:45,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:56:45,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856241444] [2025-01-09 03:56:45,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:56:45,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:56:45,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:45,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:56:45,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:56:45,040 INFO L87 Difference]: Start difference. First operand 513 states and 791 transitions. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 03:56:45,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:45,236 INFO L93 Difference]: Finished difference Result 1194 states and 1904 transitions. [2025-01-09 03:56:45,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:56:45,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 141 [2025-01-09 03:56:45,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:45,246 INFO L225 Difference]: With dead ends: 1194 [2025-01-09 03:56:45,246 INFO L226 Difference]: Without dead ends: 949 [2025-01-09 03:56:45,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:56:45,248 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 398 mSDsluCounter, 2702 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 3389 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:45,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 3389 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:56:45,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2025-01-09 03:56:45,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 925. [2025-01-09 03:56:45,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 729 states have (on average 1.617283950617284) internal successors, (1179), 736 states have internal predecessors, (1179), 163 states have call successors, (163), 29 states have call predecessors, (163), 32 states have return successors, (184), 161 states have call predecessors, (184), 162 states have call successors, (184) [2025-01-09 03:56:45,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1526 transitions. [2025-01-09 03:56:45,300 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1526 transitions. Word has length 141 [2025-01-09 03:56:45,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:45,301 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1526 transitions. [2025-01-09 03:56:45,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 03:56:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1526 transitions. [2025-01-09 03:56:45,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 03:56:45,307 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:45,307 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:45,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:56:45,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:45,508 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:45,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:45,508 INFO L85 PathProgramCache]: Analyzing trace with hash 22053878, now seen corresponding path program 1 times [2025-01-09 03:56:45,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:45,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556581120] [2025-01-09 03:56:45,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:45,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:45,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 03:56:45,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 03:56:45,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:45,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 03:56:45,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:45,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556581120] [2025-01-09 03:56:45,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556581120] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:45,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:45,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:45,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490408390] [2025-01-09 03:56:45,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:45,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:45,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:45,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:45,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:45,603 INFO L87 Difference]: Start difference. First operand 925 states and 1526 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:56:45,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:45,660 INFO L93 Difference]: Finished difference Result 2198 states and 3682 transitions. [2025-01-09 03:56:45,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:45,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 167 [2025-01-09 03:56:45,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:45,671 INFO L225 Difference]: With dead ends: 2198 [2025-01-09 03:56:45,671 INFO L226 Difference]: Without dead ends: 1341 [2025-01-09 03:56:45,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:45,677 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 132 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:45,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1316 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:45,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2025-01-09 03:56:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1333. [2025-01-09 03:56:45,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1058 states have (on average 1.6370510396975426) internal successors, (1732), 1065 states have internal predecessors, (1732), 242 states have call successors, (242), 29 states have call predecessors, (242), 32 states have return successors, (273), 240 states have call predecessors, (273), 241 states have call successors, (273) [2025-01-09 03:56:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 2247 transitions. [2025-01-09 03:56:45,744 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 2247 transitions. Word has length 167 [2025-01-09 03:56:45,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:45,745 INFO L471 AbstractCegarLoop]: Abstraction has 1333 states and 2247 transitions. [2025-01-09 03:56:45,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:56:45,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 2247 transitions. [2025-01-09 03:56:45,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 03:56:45,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:45,755 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:45,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:56:45,755 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:45,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:45,756 INFO L85 PathProgramCache]: Analyzing trace with hash -52779847, now seen corresponding path program 1 times [2025-01-09 03:56:45,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:45,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249854047] [2025-01-09 03:56:45,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:45,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:45,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 03:56:45,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 03:56:45,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:45,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:45,841 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 03:56:45,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:45,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249854047] [2025-01-09 03:56:45,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249854047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:45,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:45,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:45,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964964470] [2025-01-09 03:56:45,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:45,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:45,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:45,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:45,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:45,843 INFO L87 Difference]: Start difference. First operand 1333 states and 2247 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:56:45,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:45,918 INFO L93 Difference]: Finished difference Result 3195 states and 5427 transitions. [2025-01-09 03:56:45,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:45,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 168 [2025-01-09 03:56:45,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:45,933 INFO L225 Difference]: With dead ends: 3195 [2025-01-09 03:56:45,934 INFO L226 Difference]: Without dead ends: 1981 [2025-01-09 03:56:45,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:45,941 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 130 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:45,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1312 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:45,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2025-01-09 03:56:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1973. [2025-01-09 03:56:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1973 states, 1579 states have (on average 1.6510449651678278) internal successors, (2607), 1586 states have internal predecessors, (2607), 361 states have call successors, (361), 29 states have call predecessors, (361), 32 states have return successors, (392), 359 states have call predecessors, (392), 360 states have call successors, (392) [2025-01-09 03:56:46,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 3360 transitions. [2025-01-09 03:56:46,093 INFO L78 Accepts]: Start accepts. Automaton has 1973 states and 3360 transitions. Word has length 168 [2025-01-09 03:56:46,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:46,094 INFO L471 AbstractCegarLoop]: Abstraction has 1973 states and 3360 transitions. [2025-01-09 03:56:46,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:56:46,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 3360 transitions. [2025-01-09 03:56:46,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 03:56:46,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:46,111 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:46,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:56:46,111 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:46,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:46,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1122951821, now seen corresponding path program 1 times [2025-01-09 03:56:46,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:46,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055258090] [2025-01-09 03:56:46,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:46,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:46,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 03:56:46,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 03:56:46,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:46,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:46,211 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:46,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:46,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055258090] [2025-01-09 03:56:46,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055258090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:46,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:46,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:46,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646585972] [2025-01-09 03:56:46,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:46,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:46,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:46,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:46,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:46,215 INFO L87 Difference]: Start difference. First operand 1973 states and 3360 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:56:46,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:46,321 INFO L93 Difference]: Finished difference Result 4697 states and 8067 transitions. [2025-01-09 03:56:46,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:46,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2025-01-09 03:56:46,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:46,343 INFO L225 Difference]: With dead ends: 4697 [2025-01-09 03:56:46,343 INFO L226 Difference]: Without dead ends: 2964 [2025-01-09 03:56:46,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:46,353 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 128 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:46,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1301 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:46,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2025-01-09 03:56:46,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 2956. [2025-01-09 03:56:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2956 states, 2400 states have (on average 1.6620833333333334) internal successors, (3989), 2407 states have internal predecessors, (3989), 523 states have call successors, (523), 29 states have call predecessors, (523), 32 states have return successors, (570), 521 states have call predecessors, (570), 522 states have call successors, (570) [2025-01-09 03:56:46,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 5082 transitions. [2025-01-09 03:56:46,511 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 5082 transitions. Word has length 150 [2025-01-09 03:56:46,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:46,511 INFO L471 AbstractCegarLoop]: Abstraction has 2956 states and 5082 transitions. [2025-01-09 03:56:46,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:56:46,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 5082 transitions. [2025-01-09 03:56:46,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 03:56:46,532 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:46,532 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:46,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:56:46,532 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:46,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:46,533 INFO L85 PathProgramCache]: Analyzing trace with hash -440340520, now seen corresponding path program 1 times [2025-01-09 03:56:46,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:46,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829920454] [2025-01-09 03:56:46,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:46,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:46,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 03:56:46,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 03:56:46,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:46,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 03:56:46,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:46,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829920454] [2025-01-09 03:56:46,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829920454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:46,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:46,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:46,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955467885] [2025-01-09 03:56:46,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:46,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:46,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:46,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:46,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:46,624 INFO L87 Difference]: Start difference. First operand 2956 states and 5082 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:56:46,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:46,798 INFO L93 Difference]: Finished difference Result 7075 states and 12253 transitions. [2025-01-09 03:56:46,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:46,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 170 [2025-01-09 03:56:46,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:46,830 INFO L225 Difference]: With dead ends: 7075 [2025-01-09 03:56:46,830 INFO L226 Difference]: Without dead ends: 4556 [2025-01-09 03:56:46,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:46,841 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 126 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:46,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1301 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:46,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4556 states. [2025-01-09 03:56:47,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4556 to 4548. [2025-01-09 03:56:47,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4548 states, 3747 states have (on average 1.6698692287163064) internal successors, (6257), 3754 states have internal predecessors, (6257), 768 states have call successors, (768), 29 states have call predecessors, (768), 32 states have return successors, (841), 766 states have call predecessors, (841), 767 states have call successors, (841) [2025-01-09 03:56:47,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4548 states to 4548 states and 7866 transitions. [2025-01-09 03:56:47,121 INFO L78 Accepts]: Start accepts. Automaton has 4548 states and 7866 transitions. Word has length 170 [2025-01-09 03:56:47,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:47,121 INFO L471 AbstractCegarLoop]: Abstraction has 4548 states and 7866 transitions. [2025-01-09 03:56:47,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:56:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 4548 states and 7866 transitions. [2025-01-09 03:56:47,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 03:56:47,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:47,152 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:47,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:56:47,152 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:47,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:47,153 INFO L85 PathProgramCache]: Analyzing trace with hash 615369257, now seen corresponding path program 1 times [2025-01-09 03:56:47,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:47,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681554842] [2025-01-09 03:56:47,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:47,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:47,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 03:56:47,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 03:56:47,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:47,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:47,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:47,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681554842] [2025-01-09 03:56:47,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681554842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:47,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:47,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:47,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608016719] [2025-01-09 03:56:47,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:47,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:47,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:47,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:47,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:47,236 INFO L87 Difference]: Start difference. First operand 4548 states and 7866 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:56:47,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:47,451 INFO L93 Difference]: Finished difference Result 11044 states and 19236 transitions. [2025-01-09 03:56:47,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:47,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 152 [2025-01-09 03:56:47,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:47,568 INFO L225 Difference]: With dead ends: 11044 [2025-01-09 03:56:47,571 INFO L226 Difference]: Without dead ends: 7234 [2025-01-09 03:56:47,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:47,588 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 124 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:47,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1315 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7234 states. [2025-01-09 03:56:47,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7234 to 7226. [2025-01-09 03:56:47,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7226 states, 5932 states have (on average 1.6700944032366825) internal successors, (9907), 5939 states have internal predecessors, (9907), 1261 states have call successors, (1261), 29 states have call predecessors, (1261), 32 states have return successors, (1378), 1259 states have call predecessors, (1378), 1260 states have call successors, (1378) [2025-01-09 03:56:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7226 states to 7226 states and 12546 transitions. [2025-01-09 03:56:48,005 INFO L78 Accepts]: Start accepts. Automaton has 7226 states and 12546 transitions. Word has length 152 [2025-01-09 03:56:48,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:48,005 INFO L471 AbstractCegarLoop]: Abstraction has 7226 states and 12546 transitions. [2025-01-09 03:56:48,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:56:48,006 INFO L276 IsEmpty]: Start isEmpty. Operand 7226 states and 12546 transitions. [2025-01-09 03:56:48,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 03:56:48,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:48,045 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:48,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:56:48,046 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:48,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:48,046 INFO L85 PathProgramCache]: Analyzing trace with hash -930022195, now seen corresponding path program 1 times [2025-01-09 03:56:48,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:48,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663636287] [2025-01-09 03:56:48,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:48,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:48,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 03:56:48,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 03:56:48,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:48,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:48,126 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:48,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:48,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663636287] [2025-01-09 03:56:48,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663636287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:48,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:48,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:48,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736850107] [2025-01-09 03:56:48,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:48,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:48,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:48,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:48,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:48,129 INFO L87 Difference]: Start difference. First operand 7226 states and 12546 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:56:48,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:48,483 INFO L93 Difference]: Finished difference Result 18246 states and 31876 transitions. [2025-01-09 03:56:48,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:48,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 153 [2025-01-09 03:56:48,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:48,559 INFO L225 Difference]: With dead ends: 18246 [2025-01-09 03:56:48,560 INFO L226 Difference]: Without dead ends: 12119 [2025-01-09 03:56:48,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:48,597 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 122 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:48,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1304 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12119 states. [2025-01-09 03:56:49,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12119 to 12111. [2025-01-09 03:56:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12111 states, 9995 states have (on average 1.671135567783892) internal successors, (16703), 10002 states have internal predecessors, (16703), 2083 states have call successors, (2083), 29 states have call predecessors, (2083), 32 states have return successors, (2278), 2081 states have call predecessors, (2278), 2082 states have call successors, (2278) [2025-01-09 03:56:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12111 states to 12111 states and 21064 transitions. [2025-01-09 03:56:49,367 INFO L78 Accepts]: Start accepts. Automaton has 12111 states and 21064 transitions. Word has length 153 [2025-01-09 03:56:49,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:49,368 INFO L471 AbstractCegarLoop]: Abstraction has 12111 states and 21064 transitions. [2025-01-09 03:56:49,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:56:49,368 INFO L276 IsEmpty]: Start isEmpty. Operand 12111 states and 21064 transitions. [2025-01-09 03:56:49,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 03:56:49,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:49,424 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:49,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:56:49,424 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:49,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:49,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1285748983, now seen corresponding path program 1 times [2025-01-09 03:56:49,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:49,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190464035] [2025-01-09 03:56:49,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:49,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:49,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 03:56:49,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 03:56:49,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:49,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:49,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:49,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190464035] [2025-01-09 03:56:49,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190464035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:49,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:49,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:49,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711554146] [2025-01-09 03:56:49,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:49,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:49,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:49,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:49,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:49,504 INFO L87 Difference]: Start difference. First operand 12111 states and 21064 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:56:50,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:50,067 INFO L93 Difference]: Finished difference Result 28966 states and 50322 transitions. [2025-01-09 03:56:50,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:50,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 154 [2025-01-09 03:56:50,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:50,173 INFO L225 Difference]: With dead ends: 28966 [2025-01-09 03:56:50,174 INFO L226 Difference]: Without dead ends: 18906 [2025-01-09 03:56:50,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:50,221 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 120 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:50,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1284 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:50,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18906 states. [2025-01-09 03:56:51,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18906 to 18898. [2025-01-09 03:56:51,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18898 states, 15579 states have (on average 1.6483086205789845) internal successors, (25679), 15586 states have internal predecessors, (25679), 3286 states have call successors, (3286), 29 states have call predecessors, (3286), 32 states have return successors, (3625), 3284 states have call predecessors, (3625), 3285 states have call successors, (3625) [2025-01-09 03:56:51,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18898 states to 18898 states and 32590 transitions. [2025-01-09 03:56:51,334 INFO L78 Accepts]: Start accepts. Automaton has 18898 states and 32590 transitions. Word has length 154 [2025-01-09 03:56:51,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:51,335 INFO L471 AbstractCegarLoop]: Abstraction has 18898 states and 32590 transitions. [2025-01-09 03:56:51,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:56:51,336 INFO L276 IsEmpty]: Start isEmpty. Operand 18898 states and 32590 transitions. [2025-01-09 03:56:51,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 03:56:51,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:51,400 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:51,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:56:51,400 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:51,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:51,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1692200658, now seen corresponding path program 1 times [2025-01-09 03:56:51,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:51,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490965934] [2025-01-09 03:56:51,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:51,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:51,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 03:56:51,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 03:56:51,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:51,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:51,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:51,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490965934] [2025-01-09 03:56:51,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490965934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:51,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:51,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:51,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355113266] [2025-01-09 03:56:51,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:51,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:51,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:51,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:51,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:51,484 INFO L87 Difference]: Start difference. First operand 18898 states and 32590 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:56:52,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:52,552 INFO L93 Difference]: Finished difference Result 49958 states and 86462 transitions. [2025-01-09 03:56:52,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:52,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 155 [2025-01-09 03:56:52,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:52,783 INFO L225 Difference]: With dead ends: 49958 [2025-01-09 03:56:52,783 INFO L226 Difference]: Without dead ends: 33724 [2025-01-09 03:56:52,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:52,868 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 118 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:52,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1312 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:52,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33724 states. [2025-01-09 03:56:54,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33724 to 33716. [2025-01-09 03:56:54,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33716 states, 27947 states have (on average 1.6452213117687051) internal successors, (45979), 27954 states have internal predecessors, (45979), 5736 states have call successors, (5736), 29 states have call predecessors, (5736), 32 states have return successors, (6349), 5734 states have call predecessors, (6349), 5735 states have call successors, (6349) [2025-01-09 03:56:54,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33716 states to 33716 states and 58064 transitions. [2025-01-09 03:56:54,739 INFO L78 Accepts]: Start accepts. Automaton has 33716 states and 58064 transitions. Word has length 155 [2025-01-09 03:56:54,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:54,740 INFO L471 AbstractCegarLoop]: Abstraction has 33716 states and 58064 transitions. [2025-01-09 03:56:54,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:56:54,740 INFO L276 IsEmpty]: Start isEmpty. Operand 33716 states and 58064 transitions. [2025-01-09 03:56:54,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 03:56:54,815 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:54,815 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:54,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:56:54,815 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:54,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:54,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1280786256, now seen corresponding path program 1 times [2025-01-09 03:56:54,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:54,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747191786] [2025-01-09 03:56:54,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:54,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:54,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 03:56:54,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 03:56:54,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:54,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:54,902 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 03:56:54,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:54,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747191786] [2025-01-09 03:56:54,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747191786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:54,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:54,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:54,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023929258] [2025-01-09 03:56:54,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:54,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:54,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:54,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:54,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:54,905 INFO L87 Difference]: Start difference. First operand 33716 states and 58064 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:56:56,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:56,593 INFO L93 Difference]: Finished difference Result 91995 states and 158889 transitions. [2025-01-09 03:56:56,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:56,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 175 [2025-01-09 03:56:56,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:56,974 INFO L225 Difference]: With dead ends: 91995 [2025-01-09 03:56:56,974 INFO L226 Difference]: Without dead ends: 61822 [2025-01-09 03:56:57,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:57,095 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 116 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:57,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1306 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:57,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61822 states. [2025-01-09 03:56:59,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61822 to 61814. [2025-01-09 03:56:59,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61814 states, 51532 states have (on average 1.640941550881006) internal successors, (84561), 51539 states have internal predecessors, (84561), 10249 states have call successors, (10249), 29 states have call predecessors, (10249), 32 states have return successors, (11394), 10247 states have call predecessors, (11394), 10248 states have call successors, (11394) [2025-01-09 03:56:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61814 states to 61814 states and 106204 transitions. [2025-01-09 03:56:59,975 INFO L78 Accepts]: Start accepts. Automaton has 61814 states and 106204 transitions. Word has length 175 [2025-01-09 03:56:59,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:59,976 INFO L471 AbstractCegarLoop]: Abstraction has 61814 states and 106204 transitions. [2025-01-09 03:56:59,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:56:59,976 INFO L276 IsEmpty]: Start isEmpty. Operand 61814 states and 106204 transitions. [2025-01-09 03:57:00,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 03:57:00,066 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:00,067 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:00,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:57:00,067 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:00,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:00,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1209399314, now seen corresponding path program 1 times [2025-01-09 03:57:00,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:00,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851666849] [2025-01-09 03:57:00,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:00,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:00,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 03:57:00,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 03:57:00,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:00,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:00,146 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:57:00,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:00,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851666849] [2025-01-09 03:57:00,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851666849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:00,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:00,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:00,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844128645] [2025-01-09 03:57:00,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:00,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:00,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:00,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:00,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:00,149 INFO L87 Difference]: Start difference. First operand 61814 states and 106204 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:57:02,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:02,765 INFO L93 Difference]: Finished difference Result 115852 states and 199435 transitions. [2025-01-09 03:57:02,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:02,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 157 [2025-01-09 03:57:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:03,385 INFO L225 Difference]: With dead ends: 115852 [2025-01-09 03:57:03,386 INFO L226 Difference]: Without dead ends: 115607 [2025-01-09 03:57:03,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:03,451 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 111 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:03,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1310 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:03,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115607 states. [2025-01-09 03:57:07,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115607 to 115599. [2025-01-09 03:57:07,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115599 states, 96949 states have (on average 1.6355403356403881) internal successors, (158564), 96956 states have internal predecessors, (158564), 18617 states have call successors, (18617), 29 states have call predecessors, (18617), 32 states have return successors, (20808), 18615 states have call predecessors, (20808), 18616 states have call successors, (20808) [2025-01-09 03:57:07,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115599 states to 115599 states and 197989 transitions. [2025-01-09 03:57:08,045 INFO L78 Accepts]: Start accepts. Automaton has 115599 states and 197989 transitions. Word has length 157 [2025-01-09 03:57:08,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:08,047 INFO L471 AbstractCegarLoop]: Abstraction has 115599 states and 197989 transitions. [2025-01-09 03:57:08,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:57:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 115599 states and 197989 transitions. [2025-01-09 03:57:08,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 03:57:08,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:08,749 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:08,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:57:08,750 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:08,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:08,750 INFO L85 PathProgramCache]: Analyzing trace with hash 974472208, now seen corresponding path program 1 times [2025-01-09 03:57:08,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:08,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804983094] [2025-01-09 03:57:08,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:08,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:08,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 03:57:08,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 03:57:08,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:08,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:57:09,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:09,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804983094] [2025-01-09 03:57:09,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804983094] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:57:09,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408346060] [2025-01-09 03:57:09,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:09,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:09,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:57:09,226 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:57:09,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:57:09,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 03:57:09,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 03:57:09,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:09,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:09,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 1241 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 03:57:09,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:57:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 03:57:09,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:57:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:57:10,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408346060] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:57:10,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:57:10,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2025-01-09 03:57:10,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408811053] [2025-01-09 03:57:10,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:57:10,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 03:57:10,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:10,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 03:57:10,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-01-09 03:57:10,246 INFO L87 Difference]: Start difference. First operand 115599 states and 197989 transitions. Second operand has 28 states, 26 states have (on average 9.807692307692308) internal successors, (255), 24 states have internal predecessors, (255), 9 states have call successors, (52), 8 states have call predecessors, (52), 12 states have return successors, (45), 11 states have call predecessors, (45), 9 states have call successors, (45) [2025-01-09 03:57:28,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:28,030 INFO L93 Difference]: Finished difference Result 461021 states and 813449 transitions. [2025-01-09 03:57:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-01-09 03:57:28,031 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 9.807692307692308) internal successors, (255), 24 states have internal predecessors, (255), 9 states have call successors, (52), 8 states have call predecessors, (52), 12 states have return successors, (45), 11 states have call predecessors, (45), 9 states have call successors, (45) Word has length 158 [2025-01-09 03:57:28,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:30,777 INFO L225 Difference]: With dead ends: 461021 [2025-01-09 03:57:30,777 INFO L226 Difference]: Without dead ends: 460780 [2025-01-09 03:57:30,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3484 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1363, Invalid=11293, Unknown=0, NotChecked=0, Total=12656 [2025-01-09 03:57:30,985 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 9252 mSDsluCounter, 5514 mSDsCounter, 0 mSdLazyCounter, 14619 mSolverCounterSat, 2883 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9323 SdHoareTripleChecker+Valid, 5775 SdHoareTripleChecker+Invalid, 17502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2883 IncrementalHoareTripleChecker+Valid, 14619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:30,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9323 Valid, 5775 Invalid, 17502 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2883 Valid, 14619 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2025-01-09 03:57:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460780 states.