./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product29.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec8_product29.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9244be1607acf28cf3da39a66e263e3f7b227fe42ed993f89a6311649f8ded26 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:26:53,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:26:53,907 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:26:53,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:26:53,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:26:53,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:26:53,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:26:53,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:26:53,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:26:53,931 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:26:53,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:26:53,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:26:53,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:26:53,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:26:53,931 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:26:53,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:26:53,932 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:26:53,932 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:26:53,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:26:53,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:26:53,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:26:53,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:26:53,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:26:53,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:26:53,932 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:26:53,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:26:53,932 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:26:53,932 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:26:53,932 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:26:53,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:26:53,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:26:53,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:26:53,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:26:53,933 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:26:53,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:26:53,933 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:26:53,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:26:53,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:26:53,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:26:53,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:26:53,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:26:53,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:26:53,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:26:53,933 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9244be1607acf28cf3da39a66e263e3f7b227fe42ed993f89a6311649f8ded26 [2025-03-03 14:26:54,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:26:54,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:26:54,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:26:54,187 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:26:54,187 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:26:54,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product29.cil.c [2025-03-03 14:26:55,277 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81c41574e/6b3b70ce590f45588ed2f661ce6221d3/FLAG673ae833a [2025-03-03 14:26:55,624 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:26:55,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product29.cil.c [2025-03-03 14:26:55,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81c41574e/6b3b70ce590f45588ed2f661ce6221d3/FLAG673ae833a [2025-03-03 14:26:55,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81c41574e/6b3b70ce590f45588ed2f661ce6221d3 [2025-03-03 14:26:55,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:26:55,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:26:55,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:26:55,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:26:55,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:26:55,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:26:55" (1/1) ... [2025-03-03 14:26:55,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d6b2079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:55, skipping insertion in model container [2025-03-03 14:26:55,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:26:55" (1/1) ... [2025-03-03 14:26:55,912 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:26:56,196 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product29.cil.c[29472,29485] [2025-03-03 14:26:56,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:26:56,319 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:26:56,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-03-03 14:26:56,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [460] [2025-03-03 14:26:56,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [509] [2025-03-03 14:26:56,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [648] [2025-03-03 14:26:56,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [692] [2025-03-03 14:26:56,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1058] [2025-03-03 14:26:56,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1075] [2025-03-03 14:26:56,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1300] [2025-03-03 14:26:56,328 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1309] [2025-03-03 14:26:56,328 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1688] [2025-03-03 14:26:56,329 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1975] [2025-03-03 14:26:56,370 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product29.cil.c[29472,29485] [2025-03-03 14:26:56,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:26:56,434 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:26:56,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:56 WrapperNode [2025-03-03 14:26:56,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:26:56,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:26:56,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:26:56,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:26:56,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:56" (1/1) ... [2025-03-03 14:26:56,453 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:56" (1/1) ... [2025-03-03 14:26:56,487 INFO L138 Inliner]: procedures = 132, calls = 214, calls flagged for inlining = 56, calls inlined = 48, statements flattened = 937 [2025-03-03 14:26:56,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:26:56,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:26:56,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:26:56,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:26:56,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:56" (1/1) ... [2025-03-03 14:26:56,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:56" (1/1) ... [2025-03-03 14:26:56,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:56" (1/1) ... [2025-03-03 14:26:56,534 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-03 14:26:56,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:56" (1/1) ... [2025-03-03 14:26:56,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:56" (1/1) ... [2025-03-03 14:26:56,551 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:56" (1/1) ... [2025-03-03 14:26:56,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:56" (1/1) ... [2025-03-03 14:26:56,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:56" (1/1) ... [2025-03-03 14:26:56,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:56" (1/1) ... [2025-03-03 14:26:56,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:26:56,573 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:26:56,573 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:26:56,573 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:26:56,574 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:56" (1/1) ... [2025-03-03 14:26:56,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:26:56,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:56,600 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:26:56,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:26:56,622 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-03 14:26:56,623 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-03 14:26:56,623 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-03 14:26:56,623 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-03 14:26:56,623 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:26:56,623 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:26:56,623 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-03 14:26:56,623 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-03 14:26:56,623 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:26:56,624 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:26:56,624 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:26:56,624 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:26:56,624 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:26:56,624 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:26:56,624 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:26:56,624 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:26:56,624 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:26:56,625 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:26:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:26:56,625 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:26:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:26:56,625 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:26:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:26:56,626 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:26:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:26:56,626 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:26:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:26:56,626 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:26:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:26:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:26:56,626 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:26:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:26:56,626 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:26:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-03 14:26:56,627 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-03 14:26:56,627 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:26:56,627 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:26:56,627 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:26:56,627 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:26:56,627 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:26:56,627 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:26:56,628 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:26:56,628 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:26:56,628 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2025-03-03 14:26:56,629 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2025-03-03 14:26:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:26:56,629 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:26:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:26:56,629 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:26:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:26:56,629 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:26:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:26:56,629 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:26:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:26:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:26:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:26:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:26:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:26:56,629 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:26:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-03 14:26:56,629 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-03 14:26:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:26:56,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:26:56,792 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:26:56,794 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:26:56,889 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L367: #res := ~retValue_acc~8; [2025-03-03 14:26:56,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1599: #res := ~retValue_acc~25; [2025-03-03 14:26:56,930 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2673: #res#1 := ~retValue_acc~38#1; [2025-03-03 14:26:56,931 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2628-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~37#1; [2025-03-03 14:26:56,950 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2897: #res := ~retValue_acc~41; [2025-03-03 14:26:57,073 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3016-1: getClientId_#res#1 := getClientId_~retValue_acc~43#1; [2025-03-03 14:26:57,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2581: #res := ~retValue_acc~36; [2025-03-03 14:26:57,088 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L645-1: createEmail_#res#1 := createEmail_~retValue_acc~16#1; [2025-03-03 14:26:57,098 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2125: #res := ~retValue_acc~30; [2025-03-03 14:26:57,108 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L293: #res := ~retValue_acc~6; [2025-03-03 14:26:57,141 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: #res := ~retValue_acc~7; [2025-03-03 14:26:57,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L404: #res := ~retValue_acc~9; [2025-03-03 14:26:57,165 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: #res := ~retValue_acc~3; [2025-03-03 14:26:57,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2451: #res := ~retValue_acc~34; [2025-03-03 14:26:57,451 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2843-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~40#1; [2025-03-03 14:26:57,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L506-1: valid_product_#res#1 := valid_product_~retValue_acc~12#1; [2025-03-03 14:26:57,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~39#1; [2025-03-03 14:26:57,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1556-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~22#1; [2025-03-03 14:26:57,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1565-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~23#1; [2025-03-03 14:26:57,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1574-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~24#1; [2025-03-03 14:26:57,458 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: #res := ~retValue_acc~2; [2025-03-03 14:26:57,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L621: #res#1 := ~retValue_acc~14#1; [2025-03-03 14:26:57,465 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L601-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~13#1; [2025-03-03 14:26:57,585 INFO L? ?]: Removed 505 outVars from TransFormulas that were not future-live. [2025-03-03 14:26:57,585 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:26:57,599 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:26:57,602 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:26:57,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:26:57 BoogieIcfgContainer [2025-03-03 14:26:57,602 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:26:57,604 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:26:57,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:26:57,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:26:57,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:26:55" (1/3) ... [2025-03-03 14:26:57,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79026d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:26:57, skipping insertion in model container [2025-03-03 14:26:57,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:56" (2/3) ... [2025-03-03 14:26:57,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79026d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:26:57, skipping insertion in model container [2025-03-03 14:26:57,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:26:57" (3/3) ... [2025-03-03 14:26:57,610 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec8_product29.cil.c [2025-03-03 14:26:57,625 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:26:57,628 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec8_product29.cil.c that has 29 procedures, 408 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:26:57,683 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:26:57,690 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;@5256ca75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:26:57,690 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:26:57,694 INFO L276 IsEmpty]: Start isEmpty. Operand has 408 states, 315 states have (on average 1.5523809523809524) internal successors, (489), 320 states have internal predecessors, (489), 63 states have call successors, (63), 28 states have call predecessors, (63), 28 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-03 14:26:57,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:26:57,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:57,707 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:57,707 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:57,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:57,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1678365918, now seen corresponding path program 1 times [2025-03-03 14:26:57,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:57,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262865051] [2025-03-03 14:26:57,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:57,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:57,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:26:57,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:26:57,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:57,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:26:58,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:58,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262865051] [2025-03-03 14:26:58,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262865051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:58,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041653580] [2025-03-03 14:26:58,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:58,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:58,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:58,297 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:58,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:26:58,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:26:58,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:26:58,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:58,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:58,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:26:58,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:26:58,594 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:58,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041653580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:58,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:58,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:26:58,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331295306] [2025-03-03 14:26:58,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:58,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:26:58,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:58,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:26:58,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:58,619 INFO L87 Difference]: Start difference. First operand has 408 states, 315 states have (on average 1.5523809523809524) internal successors, (489), 320 states have internal predecessors, (489), 63 states have call successors, (63), 28 states have call predecessors, (63), 28 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:26:58,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:58,681 INFO L93 Difference]: Finished difference Result 629 states and 930 transitions. [2025-03-03 14:26:58,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:26:58,683 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2025-03-03 14:26:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:58,692 INFO L225 Difference]: With dead ends: 629 [2025-03-03 14:26:58,693 INFO L226 Difference]: Without dead ends: 401 [2025-03-03 14:26:58,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:58,698 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:58,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:58,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-03 14:26:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2025-03-03 14:26:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 309 states have (on average 1.5501618122977345) internal successors, (479), 313 states have internal predecessors, (479), 63 states have call successors, (63), 28 states have call predecessors, (63), 28 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-03 14:26:58,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 604 transitions. [2025-03-03 14:26:58,750 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 604 transitions. Word has length 110 [2025-03-03 14:26:58,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:58,751 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 604 transitions. [2025-03-03 14:26:58,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:26:58,751 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 604 transitions. [2025-03-03 14:26:58,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:26:58,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:58,758 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:58,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:26:58,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:26:58,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:58,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:58,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1125986160, now seen corresponding path program 1 times [2025-03-03 14:26:58,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:58,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236084354] [2025-03-03 14:26:58,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:58,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:58,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:26:59,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:26:59,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:59,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:26:59,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:59,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236084354] [2025-03-03 14:26:59,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236084354] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:59,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270295848] [2025-03-03 14:26:59,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:59,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:59,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:59,159 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:59,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:26:59,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:26:59,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:26:59,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:59,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:59,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 1068 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:26:59,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:26:59,446 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:59,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270295848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:59,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:59,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:26:59,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853402129] [2025-03-03 14:26:59,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:59,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:59,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:59,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:59,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:26:59,447 INFO L87 Difference]: Start difference. First operand 401 states and 604 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:26:59,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:59,489 INFO L93 Difference]: Finished difference Result 618 states and 908 transitions. [2025-03-03 14:26:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:59,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2025-03-03 14:26:59,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:59,493 INFO L225 Difference]: With dead ends: 618 [2025-03-03 14:26:59,493 INFO L226 Difference]: Without dead ends: 403 [2025-03-03 14:26:59,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:26:59,495 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 0 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:59,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1204 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:59,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-03 14:26:59,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-03-03 14:26:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 311 states have (on average 1.5466237942122187) internal successors, (481), 315 states have internal predecessors, (481), 63 states have call successors, (63), 28 states have call predecessors, (63), 28 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-03 14:26:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 606 transitions. [2025-03-03 14:26:59,519 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 606 transitions. Word has length 111 [2025-03-03 14:26:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:59,520 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 606 transitions. [2025-03-03 14:26:59,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:26:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 606 transitions. [2025-03-03 14:26:59,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:26:59,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:59,524 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:59,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:26:59,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:26:59,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:59,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:59,725 INFO L85 PathProgramCache]: Analyzing trace with hash -711667533, now seen corresponding path program 1 times [2025-03-03 14:26:59,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:59,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740513877] [2025-03-03 14:26:59,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:59,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:59,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:26:59,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:26:59,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:59,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:26:59,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:59,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740513877] [2025-03-03 14:26:59,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740513877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:59,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946736208] [2025-03-03 14:26:59,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:59,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:59,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:59,936 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:59,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:27:00,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:27:00,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:27:00,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:00,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:00,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 1080 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:27:00,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:27:00,218 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:27:00,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946736208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:00,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:27:00,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:27:00,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659263461] [2025-03-03 14:27:00,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:00,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:00,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:00,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:00,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:27:00,222 INFO L87 Difference]: Start difference. First operand 403 states and 606 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:00,255 INFO L93 Difference]: Finished difference Result 848 states and 1295 transitions. [2025-03-03 14:27:00,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:00,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2025-03-03 14:27:00,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:00,259 INFO L225 Difference]: With dead ends: 848 [2025-03-03 14:27:00,259 INFO L226 Difference]: Without dead ends: 472 [2025-03-03 14:27:00,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:27:00,261 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 126 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:00,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1176 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:00,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-03-03 14:27:00,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 464. [2025-03-03 14:27:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 358 states have (on average 1.5670391061452513) internal successors, (561), 362 states have internal predecessors, (561), 77 states have call successors, (77), 28 states have call predecessors, (77), 28 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 14:27:00,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 714 transitions. [2025-03-03 14:27:00,281 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 714 transitions. Word has length 116 [2025-03-03 14:27:00,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:00,281 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 714 transitions. [2025-03-03 14:27:00,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:00,281 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 714 transitions. [2025-03-03 14:27:00,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:27:00,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:00,283 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:00,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:27:00,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:00,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:00,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:00,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1666778197, now seen corresponding path program 1 times [2025-03-03 14:27:00,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:00,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807952412] [2025-03-03 14:27:00,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:00,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:00,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:27:00,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:27:00,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:00,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:27:00,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:00,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807952412] [2025-03-03 14:27:00,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807952412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:27:00,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829104097] [2025-03-03 14:27:00,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:00,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:00,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:00,640 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:27:00,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:27:00,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:27:00,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:27:00,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:00,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:00,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 1085 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:27:00,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:27:00,941 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:27:00,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829104097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:00,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:27:00,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:27:00,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980183101] [2025-03-03 14:27:00,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:00,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:00,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:00,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:00,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:27:00,944 INFO L87 Difference]: Start difference. First operand 464 states and 714 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:01,019 INFO L93 Difference]: Finished difference Result 919 states and 1418 transitions. [2025-03-03 14:27:01,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:01,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2025-03-03 14:27:01,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:01,024 INFO L225 Difference]: With dead ends: 919 [2025-03-03 14:27:01,024 INFO L226 Difference]: Without dead ends: 466 [2025-03-03 14:27:01,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 115 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-03-03 14:27:01,027 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 2 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2373 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-03-03 14:27:01,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2373 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:01,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-03-03 14:27:01,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2025-03-03 14:27:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 359 states have (on average 1.565459610027855) internal successors, (562), 364 states have internal predecessors, (562), 77 states have call successors, (77), 28 states have call predecessors, (77), 29 states have return successors, (78), 75 states have call predecessors, (78), 76 states have call successors, (78) [2025-03-03 14:27:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 717 transitions. [2025-03-03 14:27:01,054 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 717 transitions. Word has length 117 [2025-03-03 14:27:01,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:01,055 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 717 transitions. [2025-03-03 14:27:01,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:01,056 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 717 transitions. [2025-03-03 14:27:01,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:27:01,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:01,059 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:01,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:27:01,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:01,259 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:01,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:01,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1788049971, now seen corresponding path program 1 times [2025-03-03 14:27:01,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:01,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574742895] [2025-03-03 14:27:01,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:01,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:01,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:27:01,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:27:01,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:01,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:27:01,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:01,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574742895] [2025-03-03 14:27:01,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574742895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:27:01,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728430590] [2025-03-03 14:27:01,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:01,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:01,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:01,423 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:27:01,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:27:01,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:27:01,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:27:01,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:01,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:01,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 1086 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:27:01,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:27:01,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:27:01,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728430590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:01,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:27:01,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:27:01,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235446706] [2025-03-03 14:27:01,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:01,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:01,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:01,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:01,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:27:01,696 INFO L87 Difference]: Start difference. First operand 466 states and 717 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:01,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:01,762 INFO L93 Difference]: Finished difference Result 921 states and 1423 transitions. [2025-03-03 14:27:01,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:01,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2025-03-03 14:27:01,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:01,765 INFO L225 Difference]: With dead ends: 921 [2025-03-03 14:27:01,765 INFO L226 Difference]: Without dead ends: 468 [2025-03-03 14:27:01,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:27:01,767 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 2 mSDsluCounter, 1765 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2359 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-03-03 14:27:01,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2359 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-03 14:27:01,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-03-03 14:27:01,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 360 states have (on average 1.5638888888888889) internal successors, (563), 366 states have internal predecessors, (563), 77 states have call successors, (77), 28 states have call predecessors, (77), 30 states have return successors, (83), 75 states have call predecessors, (83), 76 states have call successors, (83) [2025-03-03 14:27:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 723 transitions. [2025-03-03 14:27:01,785 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 723 transitions. Word has length 118 [2025-03-03 14:27:01,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:01,785 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 723 transitions. [2025-03-03 14:27:01,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:01,786 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 723 transitions. [2025-03-03 14:27:01,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:27:01,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:01,788 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:01,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:27:01,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:01,989 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:01,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:01,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1889293408, now seen corresponding path program 1 times [2025-03-03 14:27:01,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:01,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513635044] [2025-03-03 14:27:01,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:01,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:02,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:27:02,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:27:02,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:02,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:27:02,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:02,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513635044] [2025-03-03 14:27:02,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513635044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:02,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:02,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:27:02,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101363262] [2025-03-03 14:27:02,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:02,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:02,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:02,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:02,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:02,090 INFO L87 Difference]: Start difference. First operand 468 states and 723 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:02,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:02,127 INFO L93 Difference]: Finished difference Result 913 states and 1414 transitions. [2025-03-03 14:27:02,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:02,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2025-03-03 14:27:02,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:02,130 INFO L225 Difference]: With dead ends: 913 [2025-03-03 14:27:02,130 INFO L226 Difference]: Without dead ends: 468 [2025-03-03 14:27:02,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:02,131 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 2 mSDsluCounter, 1780 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2377 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-03-03 14:27:02,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2377 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:02,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-03 14:27:02,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-03-03 14:27:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 360 states have (on average 1.5638888888888889) internal successors, (563), 366 states have internal predecessors, (563), 77 states have call successors, (77), 28 states have call predecessors, (77), 30 states have return successors, (82), 75 states have call predecessors, (82), 76 states have call successors, (82) [2025-03-03 14:27:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 722 transitions. [2025-03-03 14:27:02,145 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 722 transitions. Word has length 119 [2025-03-03 14:27:02,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:02,146 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 722 transitions. [2025-03-03 14:27:02,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:02,146 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 722 transitions. [2025-03-03 14:27:02,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:27:02,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:02,147 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:02,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:27:02,148 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:02,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:02,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2019830172, now seen corresponding path program 2 times [2025-03-03 14:27:02,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:02,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465003745] [2025-03-03 14:27:02,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:27:02,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:02,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-03-03 14:27:02,172 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:27:02,172 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:27:02,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:02,252 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:27:02,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:02,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465003745] [2025-03-03 14:27:02,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465003745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:02,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:02,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:27:02,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624229594] [2025-03-03 14:27:02,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:02,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:02,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:02,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:02,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:02,253 INFO L87 Difference]: Start difference. First operand 468 states and 722 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:02,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:02,298 INFO L93 Difference]: Finished difference Result 911 states and 1409 transitions. [2025-03-03 14:27:02,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:02,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2025-03-03 14:27:02,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:02,301 INFO L225 Difference]: With dead ends: 911 [2025-03-03 14:27:02,301 INFO L226 Difference]: Without dead ends: 468 [2025-03-03 14:27:02,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:02,303 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 2 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:02,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2363 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:02,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-03 14:27:02,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-03-03 14:27:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 360 states have (on average 1.5638888888888889) internal successors, (563), 366 states have internal predecessors, (563), 77 states have call successors, (77), 28 states have call predecessors, (77), 30 states have return successors, (81), 75 states have call predecessors, (81), 76 states have call successors, (81) [2025-03-03 14:27:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 721 transitions. [2025-03-03 14:27:02,321 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 721 transitions. Word has length 120 [2025-03-03 14:27:02,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:02,321 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 721 transitions. [2025-03-03 14:27:02,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:02,322 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 721 transitions. [2025-03-03 14:27:02,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:27:02,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:02,323 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:02,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:27:02,323 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:02,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:02,324 INFO L85 PathProgramCache]: Analyzing trace with hash -781478247, now seen corresponding path program 3 times [2025-03-03 14:27:02,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:02,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007821088] [2025-03-03 14:27:02,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:27:02,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:02,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 121 statements into 3 equivalence classes. [2025-03-03 14:27:02,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 109 of 121 statements. [2025-03-03 14:27:02,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 14:27:02,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:02,429 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:27:02,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:02,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007821088] [2025-03-03 14:27:02,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007821088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:02,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:02,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:27:02,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940829016] [2025-03-03 14:27:02,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:02,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:02,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:02,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:02,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:02,431 INFO L87 Difference]: Start difference. First operand 468 states and 721 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:02,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:02,478 INFO L93 Difference]: Finished difference Result 913 states and 1415 transitions. [2025-03-03 14:27:02,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:02,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2025-03-03 14:27:02,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:02,482 INFO L225 Difference]: With dead ends: 913 [2025-03-03 14:27:02,482 INFO L226 Difference]: Without dead ends: 470 [2025-03-03 14:27:02,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:02,484 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2374 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-03-03 14:27:02,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2374 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:02,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-03 14:27:02,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2025-03-03 14:27:02,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 361 states have (on average 1.5623268698060941) internal successors, (564), 368 states have internal predecessors, (564), 77 states have call successors, (77), 28 states have call predecessors, (77), 31 states have return successors, (86), 75 states have call predecessors, (86), 76 states have call successors, (86) [2025-03-03 14:27:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 727 transitions. [2025-03-03 14:27:02,498 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 727 transitions. Word has length 121 [2025-03-03 14:27:02,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:02,499 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 727 transitions. [2025-03-03 14:27:02,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:02,499 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 727 transitions. [2025-03-03 14:27:02,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 14:27:02,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:02,501 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:02,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:27:02,501 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:02,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:02,502 INFO L85 PathProgramCache]: Analyzing trace with hash 215348103, now seen corresponding path program 1 times [2025-03-03 14:27:02,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:02,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901060266] [2025-03-03 14:27:02,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:02,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:02,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:27:02,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:27:02,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:02,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:02,599 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:27:02,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:02,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901060266] [2025-03-03 14:27:02,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901060266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:02,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:02,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:27:02,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642030088] [2025-03-03 14:27:02,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:02,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:02,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:02,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:02,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:02,600 INFO L87 Difference]: Start difference. First operand 470 states and 727 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:02,640 INFO L93 Difference]: Finished difference Result 919 states and 1425 transitions. [2025-03-03 14:27:02,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:02,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2025-03-03 14:27:02,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:02,643 INFO L225 Difference]: With dead ends: 919 [2025-03-03 14:27:02,643 INFO L226 Difference]: Without dead ends: 472 [2025-03-03 14:27:02,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:02,645 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2380 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-03-03 14:27:02,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2380 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:02,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-03-03 14:27:02,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2025-03-03 14:27:02,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 362 states have (on average 1.5607734806629834) internal successors, (565), 370 states have internal predecessors, (565), 77 states have call successors, (77), 28 states have call predecessors, (77), 32 states have return successors, (88), 75 states have call predecessors, (88), 76 states have call successors, (88) [2025-03-03 14:27:02,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 730 transitions. [2025-03-03 14:27:02,660 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 730 transitions. Word has length 122 [2025-03-03 14:27:02,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:02,661 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 730 transitions. [2025-03-03 14:27:02,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:02,661 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 730 transitions. [2025-03-03 14:27:02,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:27:02,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:02,663 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:02,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:27:02,663 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:02,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:02,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1189053894, now seen corresponding path program 1 times [2025-03-03 14:27:02,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:02,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809907874] [2025-03-03 14:27:02,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:02,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:02,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:27:02,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:27:02,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:02,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:02,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:02,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809907874] [2025-03-03 14:27:02,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809907874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:27:02,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946601970] [2025-03-03 14:27:02,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:02,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:02,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:02,768 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:27:02,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:27:02,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:27:02,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:27:02,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:02,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:02,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:27:02,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:03,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:27:03,087 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:03,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946601970] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:27:03,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:27:03,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 14:27:03,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946043] [2025-03-03 14:27:03,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:27:03,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:27:03,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:03,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:27:03,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:27:03,088 INFO L87 Difference]: Start difference. First operand 472 states and 730 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 14:27:03,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:03,218 INFO L93 Difference]: Finished difference Result 1099 states and 1760 transitions. [2025-03-03 14:27:03,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:27:03,218 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 123 [2025-03-03 14:27:03,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:03,223 INFO L225 Difference]: With dead ends: 1099 [2025-03-03 14:27:03,223 INFO L226 Difference]: Without dead ends: 884 [2025-03-03 14:27:03,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:27:03,225 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 489 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 2164 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:03,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 2164 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:27:03,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-03-03 14:27:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 860. [2025-03-03 14:27:03,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 671 states have (on average 1.6289120715350223) internal successors, (1093), 679 states have internal predecessors, (1093), 156 states have call successors, (156), 28 states have call predecessors, (156), 32 states have return successors, (177), 154 states have call predecessors, (177), 155 states have call successors, (177) [2025-03-03 14:27:03,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1426 transitions. [2025-03-03 14:27:03,253 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1426 transitions. Word has length 123 [2025-03-03 14:27:03,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:03,253 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1426 transitions. [2025-03-03 14:27:03,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 14:27:03,253 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1426 transitions. [2025-03-03 14:27:03,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 14:27:03,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:03,257 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:03,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 14:27:03,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:03,458 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:03,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:03,458 INFO L85 PathProgramCache]: Analyzing trace with hash 252804070, now seen corresponding path program 1 times [2025-03-03 14:27:03,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:03,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508237870] [2025-03-03 14:27:03,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:03,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:03,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:27:03,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:27:03,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:03,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:03,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:03,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508237870] [2025-03-03 14:27:03,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508237870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:03,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:03,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:03,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581968356] [2025-03-03 14:27:03,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:03,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:03,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:03,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:03,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:03,516 INFO L87 Difference]: Start difference. First operand 860 states and 1426 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:03,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:03,549 INFO L93 Difference]: Finished difference Result 2047 states and 3446 transitions. [2025-03-03 14:27:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:03,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2025-03-03 14:27:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:03,556 INFO L225 Difference]: With dead ends: 2047 [2025-03-03 14:27:03,556 INFO L226 Difference]: Without dead ends: 1253 [2025-03-03 14:27:03,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:03,559 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 124 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:03,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1211 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:03,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2025-03-03 14:27:03,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1245. [2025-03-03 14:27:03,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 977 states have (on average 1.645854657113613) internal successors, (1608), 985 states have internal predecessors, (1608), 235 states have call successors, (235), 28 states have call predecessors, (235), 32 states have return successors, (266), 233 states have call predecessors, (266), 234 states have call successors, (266) [2025-03-03 14:27:03,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 2109 transitions. [2025-03-03 14:27:03,600 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 2109 transitions. Word has length 129 [2025-03-03 14:27:03,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:03,600 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 2109 transitions. [2025-03-03 14:27:03,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:03,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 2109 transitions. [2025-03-03 14:27:03,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 14:27:03,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:03,606 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:03,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:27:03,607 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:03,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:03,607 INFO L85 PathProgramCache]: Analyzing trace with hash 513593049, now seen corresponding path program 1 times [2025-03-03 14:27:03,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:03,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930739688] [2025-03-03 14:27:03,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:03,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:03,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:27:03,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:27:03,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:03,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:03,655 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:03,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:03,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930739688] [2025-03-03 14:27:03,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930739688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:03,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:03,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:03,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219675452] [2025-03-03 14:27:03,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:03,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:03,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:03,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:03,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:03,657 INFO L87 Difference]: Start difference. First operand 1245 states and 2109 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:03,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:03,703 INFO L93 Difference]: Finished difference Result 2985 states and 5093 transitions. [2025-03-03 14:27:03,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:03,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-03-03 14:27:03,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:03,713 INFO L225 Difference]: With dead ends: 2985 [2025-03-03 14:27:03,713 INFO L226 Difference]: Without dead ends: 1857 [2025-03-03 14:27:03,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:03,718 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 122 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:03,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1202 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:03,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2025-03-03 14:27:03,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1849. [2025-03-03 14:27:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1849 states, 1462 states have (on average 1.6573187414500683) internal successors, (2423), 1470 states have internal predecessors, (2423), 354 states have call successors, (354), 28 states have call predecessors, (354), 32 states have return successors, (385), 352 states have call predecessors, (385), 353 states have call successors, (385) [2025-03-03 14:27:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 3162 transitions. [2025-03-03 14:27:03,783 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 3162 transitions. Word has length 130 [2025-03-03 14:27:03,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:03,783 INFO L471 AbstractCegarLoop]: Abstraction has 1849 states and 3162 transitions. [2025-03-03 14:27:03,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:03,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 3162 transitions. [2025-03-03 14:27:03,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 14:27:03,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:03,793 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:03,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:27:03,793 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:03,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:03,793 INFO L85 PathProgramCache]: Analyzing trace with hash -803572091, now seen corresponding path program 1 times [2025-03-03 14:27:03,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:03,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148592536] [2025-03-03 14:27:03,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:03,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:03,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:27:03,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:27:03,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:03,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:03,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:03,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148592536] [2025-03-03 14:27:03,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148592536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:03,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:03,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:03,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299669791] [2025-03-03 14:27:03,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:03,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:03,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:03,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:03,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:03,856 INFO L87 Difference]: Start difference. First operand 1849 states and 3162 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:03,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:03,918 INFO L93 Difference]: Finished difference Result 4392 states and 7575 transitions. [2025-03-03 14:27:03,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:03,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 131 [2025-03-03 14:27:03,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:03,933 INFO L225 Difference]: With dead ends: 4392 [2025-03-03 14:27:03,933 INFO L226 Difference]: Without dead ends: 2782 [2025-03-03 14:27:03,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:03,939 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 120 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:03,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1197 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:03,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2782 states. [2025-03-03 14:27:04,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 2774. [2025-03-03 14:27:04,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2774 states, 2225 states have (on average 1.6665168539325843) internal successors, (3708), 2233 states have internal predecessors, (3708), 516 states have call successors, (516), 28 states have call predecessors, (516), 32 states have return successors, (563), 514 states have call predecessors, (563), 515 states have call successors, (563) [2025-03-03 14:27:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 4787 transitions. [2025-03-03 14:27:04,031 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 4787 transitions. Word has length 131 [2025-03-03 14:27:04,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:04,032 INFO L471 AbstractCegarLoop]: Abstraction has 2774 states and 4787 transitions. [2025-03-03 14:27:04,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 4787 transitions. [2025-03-03 14:27:04,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 14:27:04,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:04,046 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:04,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:27:04,046 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:04,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:04,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1837821402, now seen corresponding path program 1 times [2025-03-03 14:27:04,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:04,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209005940] [2025-03-03 14:27:04,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:04,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:04,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:27:04,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:27:04,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:04,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:04,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:04,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209005940] [2025-03-03 14:27:04,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209005940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:04,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:04,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:04,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286026151] [2025-03-03 14:27:04,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:04,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:04,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:04,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:04,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:04,098 INFO L87 Difference]: Start difference. First operand 2774 states and 4787 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:04,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:04,189 INFO L93 Difference]: Finished difference Result 6610 states and 11496 transitions. [2025-03-03 14:27:04,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:04,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-03-03 14:27:04,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:04,214 INFO L225 Difference]: With dead ends: 6610 [2025-03-03 14:27:04,214 INFO L226 Difference]: Without dead ends: 4275 [2025-03-03 14:27:04,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:04,265 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 118 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:04,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1197 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:04,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2025-03-03 14:27:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 4267. [2025-03-03 14:27:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4267 states, 3473 states have (on average 1.6731932047221423) internal successors, (5811), 3481 states have internal predecessors, (5811), 761 states have call successors, (761), 28 states have call predecessors, (761), 32 states have return successors, (834), 759 states have call predecessors, (834), 760 states have call successors, (834) [2025-03-03 14:27:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 7406 transitions. [2025-03-03 14:27:04,427 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 7406 transitions. Word has length 132 [2025-03-03 14:27:04,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:04,428 INFO L471 AbstractCegarLoop]: Abstraction has 4267 states and 7406 transitions. [2025-03-03 14:27:04,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 7406 transitions. [2025-03-03 14:27:04,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:27:04,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:04,446 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:04,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:27:04,447 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:04,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:04,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2036046404, now seen corresponding path program 1 times [2025-03-03 14:27:04,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:04,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9368332] [2025-03-03 14:27:04,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:04,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:04,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:27:04,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:27:04,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:04,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:04,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:04,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9368332] [2025-03-03 14:27:04,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9368332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:04,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:04,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:04,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968232528] [2025-03-03 14:27:04,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:04,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:04,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:04,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:04,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:04,503 INFO L87 Difference]: Start difference. First operand 4267 states and 7406 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:04,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:04,683 INFO L93 Difference]: Finished difference Result 10570 states and 18452 transitions. [2025-03-03 14:27:04,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:04,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2025-03-03 14:27:04,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:04,727 INFO L225 Difference]: With dead ends: 10570 [2025-03-03 14:27:04,727 INFO L226 Difference]: Without dead ends: 6969 [2025-03-03 14:27:04,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:04,741 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 116 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:04,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1222 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:04,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6969 states. [2025-03-03 14:27:05,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6969 to 6961. [2025-03-03 14:27:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6961 states, 5674 states have (on average 1.6702502643637644) internal successors, (9477), 5682 states have internal predecessors, (9477), 1254 states have call successors, (1254), 28 states have call predecessors, (1254), 32 states have return successors, (1371), 1252 states have call predecessors, (1371), 1253 states have call successors, (1371) [2025-03-03 14:27:05,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6961 states to 6961 states and 12102 transitions. [2025-03-03 14:27:05,074 INFO L78 Accepts]: Start accepts. Automaton has 6961 states and 12102 transitions. Word has length 133 [2025-03-03 14:27:05,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:05,074 INFO L471 AbstractCegarLoop]: Abstraction has 6961 states and 12102 transitions. [2025-03-03 14:27:05,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:05,079 INFO L276 IsEmpty]: Start isEmpty. Operand 6961 states and 12102 transitions. [2025-03-03 14:27:05,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 14:27:05,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:05,101 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:05,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:27:05,101 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:05,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:05,102 INFO L85 PathProgramCache]: Analyzing trace with hash -820605925, now seen corresponding path program 1 times [2025-03-03 14:27:05,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:05,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451041513] [2025-03-03 14:27:05,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:05,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:05,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 14:27:05,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 14:27:05,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:05,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:05,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:05,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451041513] [2025-03-03 14:27:05,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451041513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:05,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:05,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:05,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176788565] [2025-03-03 14:27:05,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:05,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:05,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:05,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:05,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:05,162 INFO L87 Difference]: Start difference. First operand 6961 states and 12102 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:05,376 INFO L93 Difference]: Finished difference Result 17605 states and 30808 transitions. [2025-03-03 14:27:05,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:05,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 134 [2025-03-03 14:27:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:05,433 INFO L225 Difference]: With dead ends: 17605 [2025-03-03 14:27:05,433 INFO L226 Difference]: Without dead ends: 11681 [2025-03-03 14:27:05,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:05,458 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 114 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:05,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1210 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:05,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11681 states. [2025-03-03 14:27:05,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11681 to 11673. [2025-03-03 14:27:05,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11673 states, 9564 states have (on average 1.6711626934337098) internal successors, (15983), 9572 states have internal predecessors, (15983), 2076 states have call successors, (2076), 28 states have call predecessors, (2076), 32 states have return successors, (2271), 2074 states have call predecessors, (2271), 2075 states have call successors, (2271) [2025-03-03 14:27:05,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11673 states to 11673 states and 20330 transitions. [2025-03-03 14:27:05,870 INFO L78 Accepts]: Start accepts. Automaton has 11673 states and 20330 transitions. Word has length 134 [2025-03-03 14:27:05,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:05,870 INFO L471 AbstractCegarLoop]: Abstraction has 11673 states and 20330 transitions. [2025-03-03 14:27:05,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:05,870 INFO L276 IsEmpty]: Start isEmpty. Operand 11673 states and 20330 transitions. [2025-03-03 14:27:05,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 14:27:05,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:05,902 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:05,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:27:05,903 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:05,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:05,903 INFO L85 PathProgramCache]: Analyzing trace with hash -458271325, now seen corresponding path program 1 times [2025-03-03 14:27:05,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:05,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316861349] [2025-03-03 14:27:05,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:05,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:05,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 14:27:05,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 14:27:05,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:05,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:05,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:05,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316861349] [2025-03-03 14:27:05,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316861349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:05,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:05,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:05,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290791457] [2025-03-03 14:27:05,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:05,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:05,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:05,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:05,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:05,951 INFO L87 Difference]: Start difference. First operand 11673 states and 20330 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:06,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:06,305 INFO L93 Difference]: Finished difference Result 27836 states and 48450 transitions. [2025-03-03 14:27:06,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:06,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 135 [2025-03-03 14:27:06,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:06,379 INFO L225 Difference]: With dead ends: 27836 [2025-03-03 14:27:06,379 INFO L226 Difference]: Without dead ends: 18137 [2025-03-03 14:27:06,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:06,417 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 112 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:06,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1180 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:06,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18137 states. [2025-03-03 14:27:07,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18137 to 18129. [2025-03-03 14:27:07,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18129 states, 14817 states have (on average 1.6475669838698792) internal successors, (24412), 14825 states have internal predecessors, (24412), 3279 states have call successors, (3279), 28 states have call predecessors, (3279), 32 states have return successors, (3618), 3277 states have call predecessors, (3618), 3278 states have call successors, (3618) [2025-03-03 14:27:07,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18129 states to 18129 states and 31309 transitions. [2025-03-03 14:27:07,346 INFO L78 Accepts]: Start accepts. Automaton has 18129 states and 31309 transitions. Word has length 135 [2025-03-03 14:27:07,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:07,346 INFO L471 AbstractCegarLoop]: Abstraction has 18129 states and 31309 transitions. [2025-03-03 14:27:07,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 18129 states and 31309 transitions. [2025-03-03 14:27:07,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 14:27:07,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:07,382 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:07,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:27:07,382 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:07,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:07,382 INFO L85 PathProgramCache]: Analyzing trace with hash -714846436, now seen corresponding path program 1 times [2025-03-03 14:27:07,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:07,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432969055] [2025-03-03 14:27:07,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:07,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:07,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:27:07,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:27:07,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:07,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:07,439 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:07,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:07,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432969055] [2025-03-03 14:27:07,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432969055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:07,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:07,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:07,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580468779] [2025-03-03 14:27:07,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:07,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:07,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:07,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:07,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:07,440 INFO L87 Difference]: Start difference. First operand 18129 states and 31309 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:08,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:08,079 INFO L93 Difference]: Finished difference Result 47863 states and 83019 transitions. [2025-03-03 14:27:08,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:08,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 136 [2025-03-03 14:27:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:08,227 INFO L225 Difference]: With dead ends: 47863 [2025-03-03 14:27:08,227 INFO L226 Difference]: Without dead ends: 32307 [2025-03-03 14:27:08,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:08,284 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 110 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:08,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1200 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:08,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32307 states. [2025-03-03 14:27:09,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32307 to 32299. [2025-03-03 14:27:09,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32299 states, 26537 states have (on average 1.644986245619324) internal successors, (43653), 26545 states have internal predecessors, (43653), 5729 states have call successors, (5729), 28 states have call predecessors, (5729), 32 states have return successors, (6342), 5727 states have call predecessors, (6342), 5728 states have call successors, (6342) [2025-03-03 14:27:09,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32299 states to 32299 states and 55724 transitions. [2025-03-03 14:27:09,409 INFO L78 Accepts]: Start accepts. Automaton has 32299 states and 55724 transitions. Word has length 136 [2025-03-03 14:27:09,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:09,410 INFO L471 AbstractCegarLoop]: Abstraction has 32299 states and 55724 transitions. [2025-03-03 14:27:09,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:09,410 INFO L276 IsEmpty]: Start isEmpty. Operand 32299 states and 55724 transitions. [2025-03-03 14:27:09,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 14:27:09,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:09,451 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:09,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:27:09,451 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:09,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:09,452 INFO L85 PathProgramCache]: Analyzing trace with hash -573710302, now seen corresponding path program 1 times [2025-03-03 14:27:09,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:09,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760652074] [2025-03-03 14:27:09,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:09,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:09,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:27:09,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:27:09,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:09,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:09,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:09,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760652074] [2025-03-03 14:27:09,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760652074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:09,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:09,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:09,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330768608] [2025-03-03 14:27:09,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:09,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:09,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:09,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:09,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:09,508 INFO L87 Difference]: Start difference. First operand 32299 states and 55724 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:10,916 INFO L93 Difference]: Finished difference Result 87980 states and 152341 transitions. [2025-03-03 14:27:10,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:10,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2025-03-03 14:27:10,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:11,166 INFO L225 Difference]: With dead ends: 87980 [2025-03-03 14:27:11,167 INFO L226 Difference]: Without dead ends: 59121 [2025-03-03 14:27:11,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:11,244 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 108 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:11,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1212 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:11,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59121 states. [2025-03-03 14:27:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59121 to 59113. [2025-03-03 14:27:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59113 states, 48838 states have (on average 1.6412015234039068) internal successors, (80153), 48846 states have internal predecessors, (80153), 10242 states have call successors, (10242), 28 states have call predecessors, (10242), 32 states have return successors, (11387), 10240 states have call predecessors, (11387), 10241 states have call successors, (11387) [2025-03-03 14:27:13,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59113 states to 59113 states and 101782 transitions. [2025-03-03 14:27:13,378 INFO L78 Accepts]: Start accepts. Automaton has 59113 states and 101782 transitions. Word has length 137 [2025-03-03 14:27:13,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:13,379 INFO L471 AbstractCegarLoop]: Abstraction has 59113 states and 101782 transitions. [2025-03-03 14:27:13,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:13,379 INFO L276 IsEmpty]: Start isEmpty. Operand 59113 states and 101782 transitions. [2025-03-03 14:27:13,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 14:27:13,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:13,426 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:13,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:27:13,426 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:13,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:13,427 INFO L85 PathProgramCache]: Analyzing trace with hash 398293693, now seen corresponding path program 1 times [2025-03-03 14:27:13,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:13,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494576285] [2025-03-03 14:27:13,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:13,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:13,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 14:27:13,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 14:27:13,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:13,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:13,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:13,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494576285] [2025-03-03 14:27:13,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494576285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:13,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:13,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:13,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613763064] [2025-03-03 14:27:13,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:13,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:13,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:13,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:13,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:13,484 INFO L87 Difference]: Start difference. First operand 59113 states and 101782 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:16,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:16,154 INFO L93 Difference]: Finished difference Result 110561 states and 190840 transitions. [2025-03-03 14:27:16,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:16,156 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 138 [2025-03-03 14:27:16,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:16,595 INFO L225 Difference]: With dead ends: 110561 [2025-03-03 14:27:16,595 INFO L226 Difference]: Without dead ends: 110346 [2025-03-03 14:27:16,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:16,645 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 103 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:16,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1214 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:16,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110346 states. [2025-03-03 14:27:19,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110346 to 110338. [2025-03-03 14:27:19,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110338 states, 91695 states have (on average 1.6361524619663013) internal successors, (150027), 91703 states have internal predecessors, (150027), 18610 states have call successors, (18610), 28 states have call predecessors, (18610), 32 states have return successors, (20801), 18608 states have call predecessors, (20801), 18609 states have call successors, (20801) [2025-03-03 14:27:20,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110338 states to 110338 states and 189438 transitions. [2025-03-03 14:27:20,367 INFO L78 Accepts]: Start accepts. Automaton has 110338 states and 189438 transitions. Word has length 138 [2025-03-03 14:27:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:20,368 INFO L471 AbstractCegarLoop]: Abstraction has 110338 states and 189438 transitions. [2025-03-03 14:27:20,368 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 110338 states and 189438 transitions. [2025-03-03 14:27:20,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 14:27:20,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:20,435 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:20,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:27:20,436 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:20,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:20,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1264366177, now seen corresponding path program 1 times [2025-03-03 14:27:20,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:20,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669774244] [2025-03-03 14:27:20,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:20,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:20,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:27:20,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:27:20,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:20,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:20,773 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:20,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:20,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669774244] [2025-03-03 14:27:20,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669774244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:20,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:20,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 14:27:20,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706622991] [2025-03-03 14:27:20,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:20,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 14:27:20,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:20,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 14:27:20,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:27:20,775 INFO L87 Difference]: Start difference. First operand 110338 states and 189438 transitions. Second operand has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 6 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-03 14:27:26,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:26,510 INFO L93 Difference]: Finished difference Result 220021 states and 383167 transitions. [2025-03-03 14:27:26,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 14:27:26,511 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 6 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 139 [2025-03-03 14:27:26,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:27,667 INFO L225 Difference]: With dead ends: 220021 [2025-03-03 14:27:27,667 INFO L226 Difference]: Without dead ends: 219812 [2025-03-03 14:27:27,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2025-03-03 14:27:27,754 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 1740 mSDsluCounter, 7192 mSDsCounter, 0 mSdLazyCounter, 1477 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 7872 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 1477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:27,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1740 Valid, 7872 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 1477 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 14:27:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219812 states.