./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec9_product29.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec9_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 e2402328b10acba07d45e1b6bd18216e1645c73446d4739f1dc37852ed64162e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:50:36,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:50:36,531 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:50:36,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:50:36,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:50:36,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:50:36,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:50:36,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:50:36,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:50:36,576 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:50:36,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:50:36,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:50:36,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:50:36,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:50:36,578 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:50:36,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:50:36,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:50:36,579 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:50:36,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:50:36,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:50:36,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:50:36,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:50:36,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:50:36,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:50:36,582 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:50:36,582 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:50:36,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:50:36,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:50:36,583 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:50:36,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:50:36,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:50:36,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:50:36,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:50:36,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:50:36,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:50:36,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:50:36,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:50:36,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:50:36,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:50:36,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:50:36,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:50:36,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:50:36,587 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> e2402328b10acba07d45e1b6bd18216e1645c73446d4739f1dc37852ed64162e [2024-11-11 20:50:36,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:50:36,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:50:36,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:50:36,886 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:50:36,887 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:50:36,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec9_product29.cil.c [2024-11-11 20:50:38,416 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:50:38,751 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:50:38,753 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product29.cil.c [2024-11-11 20:50:38,776 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e3686cf0/9c91389daf76422197dd258b7305eac3/FLAG03e1471eb [2024-11-11 20:50:38,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e3686cf0/9c91389daf76422197dd258b7305eac3 [2024-11-11 20:50:38,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:50:38,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:50:38,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:50:38,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:50:38,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:50:38,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:50:38" (1/1) ... [2024-11-11 20:50:38,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fab4655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:38, skipping insertion in model container [2024-11-11 20:50:38,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:50:38" (1/1) ... [2024-11-11 20:50:38,872 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:50:39,540 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product29.cil.c[65089,65102] [2024-11-11 20:50:39,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:50:39,558 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:50:39,568 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2024-11-11 20:50:39,570 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [97] [2024-11-11 20:50:39,571 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [246] [2024-11-11 20:50:39,571 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [290] [2024-11-11 20:50:39,571 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [674] [2024-11-11 20:50:39,571 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [691] [2024-11-11 20:50:39,571 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1057] [2024-11-11 20:50:39,572 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1282] [2024-11-11 20:50:39,572 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1679] [2024-11-11 20:50:39,572 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2752] [2024-11-11 20:50:39,572 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3030] [2024-11-11 20:50:39,675 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product29.cil.c[65089,65102] [2024-11-11 20:50:39,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:50:39,755 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:50:39,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:39 WrapperNode [2024-11-11 20:50:39,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:50:39,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:50:39,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:50:39,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:50:39,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:39" (1/1) ... [2024-11-11 20:50:39,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:39" (1/1) ... [2024-11-11 20:50:39,874 INFO L138 Inliner]: procedures = 132, calls = 214, calls flagged for inlining = 56, calls inlined = 48, statements flattened = 940 [2024-11-11 20:50:39,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:50:39,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:50:39,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:50:39,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:50:39,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:39" (1/1) ... [2024-11-11 20:50:39,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:39" (1/1) ... [2024-11-11 20:50:39,891 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:39" (1/1) ... [2024-11-11 20:50:39,919 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]. [2024-11-11 20:50:39,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:39" (1/1) ... [2024-11-11 20:50:39,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:39" (1/1) ... [2024-11-11 20:50:39,936 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:39" (1/1) ... [2024-11-11 20:50:39,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:39" (1/1) ... [2024-11-11 20:50:39,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:39" (1/1) ... [2024-11-11 20:50:39,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:39" (1/1) ... [2024-11-11 20:50:39,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:50:39,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:50:39,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:50:39,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:50:39,972 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:39" (1/1) ... [2024-11-11 20:50:39,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:50:39,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:50:40,023 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) [2024-11-11 20:50:40,026 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 [2024-11-11 20:50:40,070 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-11-11 20:50:40,071 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-11-11 20:50:40,071 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2024-11-11 20:50:40,071 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2024-11-11 20:50:40,071 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-11 20:50:40,071 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-11 20:50:40,071 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2024-11-11 20:50:40,072 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2024-11-11 20:50:40,072 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-11 20:50:40,072 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-11 20:50:40,072 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-11 20:50:40,072 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-11 20:50:40,072 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-11 20:50:40,072 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-11 20:50:40,072 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-11 20:50:40,073 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-11 20:50:40,073 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-11 20:50:40,073 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-11 20:50:40,073 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-11 20:50:40,073 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-11 20:50:40,073 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-11 20:50:40,073 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-11 20:50:40,073 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-11 20:50:40,074 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-11 20:50:40,074 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-11 20:50:40,074 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-11 20:50:40,074 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-11 20:50:40,074 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-11 20:50:40,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:50:40,074 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-11 20:50:40,074 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-11 20:50:40,075 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-11-11 20:50:40,075 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-11-11 20:50:40,075 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2024-11-11 20:50:40,075 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2024-11-11 20:50:40,075 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-11 20:50:40,075 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-11 20:50:40,075 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-11 20:50:40,076 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-11 20:50:40,076 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-11 20:50:40,076 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-11 20:50:40,076 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-11 20:50:40,076 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-11 20:50:40,076 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2024-11-11 20:50:40,076 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2024-11-11 20:50:40,076 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-11 20:50:40,077 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-11 20:50:40,077 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-11 20:50:40,077 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-11 20:50:40,077 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-11 20:50:40,077 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-11 20:50:40,077 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-11 20:50:40,077 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-11 20:50:40,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:50:40,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:50:40,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:50:40,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:50:40,078 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-11 20:50:40,078 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-11 20:50:40,078 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2024-11-11 20:50:40,078 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2024-11-11 20:50:40,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:50:40,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:50:40,320 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:50:40,322 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:50:41,374 INFO L? ?]: Removed 505 outVars from TransFormulas that were not future-live. [2024-11-11 20:50:41,374 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:50:41,408 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:50:41,409 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:50:41,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:50:41 BoogieIcfgContainer [2024-11-11 20:50:41,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:50:41,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:50:41,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:50:41,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:50:41,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:50:38" (1/3) ... [2024-11-11 20:50:41,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45814312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:50:41, skipping insertion in model container [2024-11-11 20:50:41,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:39" (2/3) ... [2024-11-11 20:50:41,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45814312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:50:41, skipping insertion in model container [2024-11-11 20:50:41,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:50:41" (3/3) ... [2024-11-11 20:50:41,421 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec9_product29.cil.c [2024-11-11 20:50:41,436 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:50:41,436 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:50:41,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:50:41,524 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;@7006cf86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:50:41,525 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:50:41,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 409 states, 316 states have (on average 1.5537974683544304) internal successors, (491), 321 states have internal predecessors, (491), 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) [2024-11-11 20:50:41,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-11 20:50:41,552 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:41,553 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] [2024-11-11 20:50:41,554 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:41,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:41,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1913469271, now seen corresponding path program 1 times [2024-11-11 20:50:41,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:41,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771498373] [2024-11-11 20:50:41,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:41,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:50:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:50:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:50:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:50:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 20:50:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:50:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:50:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:50:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:50:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:50:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:50:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 20:50:42,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:42,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771498373] [2024-11-11 20:50:42,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771498373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:50:42,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604822283] [2024-11-11 20:50:42,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:42,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:50:42,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:50:42,418 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) [2024-11-11 20:50:42,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:50:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 20:50:42,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:50:42,810 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:50:42,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:50:42,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604822283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:42,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:50:42,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-11 20:50:42,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102294262] [2024-11-11 20:50:42,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:42,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:50:42,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:42,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:50:42,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:50:42,846 INFO L87 Difference]: Start difference. First operand has 409 states, 316 states have (on average 1.5537974683544304) internal successors, (491), 321 states have internal predecessors, (491), 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) [2024-11-11 20:50:42,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:42,903 INFO L93 Difference]: Finished difference Result 630 states and 932 transitions. [2024-11-11 20:50:42,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:50:42,905 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 [2024-11-11 20:50:42,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:42,919 INFO L225 Difference]: With dead ends: 630 [2024-11-11 20:50:42,919 INFO L226 Difference]: Without dead ends: 402 [2024-11-11 20:50:42,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:50:42,927 INFO L435 NwaCegarLoop]: 613 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, 613 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 [2024-11-11 20:50:42,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:50:42,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-11 20:50:42,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2024-11-11 20:50:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 310 states have (on average 1.5483870967741935) internal successors, (480), 314 states have internal predecessors, (480), 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) [2024-11-11 20:50:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 605 transitions. [2024-11-11 20:50:43,007 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 605 transitions. Word has length 110 [2024-11-11 20:50:43,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:43,009 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 605 transitions. [2024-11-11 20:50:43,009 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) [2024-11-11 20:50:43,010 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 605 transitions. [2024-11-11 20:50:43,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 20:50:43,021 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:43,021 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] [2024-11-11 20:50:43,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 20:50:43,222 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 [2024-11-11 20:50:43,222 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:43,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:43,223 INFO L85 PathProgramCache]: Analyzing trace with hash -491967672, now seen corresponding path program 1 times [2024-11-11 20:50:43,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:43,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268632127] [2024-11-11 20:50:43,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:43,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:43,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:43,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:43,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:43,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:50:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:43,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:50:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:43,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:50:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:43,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:50:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:43,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:50:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:43,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:50:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:43,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:50:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:43,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:50:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:43,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:50:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:43,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:50:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:43,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:50:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:43,565 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 20:50:43,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:43,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268632127] [2024-11-11 20:50:43,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268632127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:50:43,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532560434] [2024-11-11 20:50:43,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:43,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:50:43,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:50:43,569 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) [2024-11-11 20:50:43,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 20:50:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:43,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 1068 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:50:43,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:50:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:50:43,951 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:50:43,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532560434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:43,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:50:43,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:50:43,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111784040] [2024-11-11 20:50:43,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:43,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:50:43,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:43,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:50:43,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:50:43,954 INFO L87 Difference]: Start difference. First operand 402 states and 605 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) [2024-11-11 20:50:44,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:44,019 INFO L93 Difference]: Finished difference Result 620 states and 910 transitions. [2024-11-11 20:50:44,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:50:44,022 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 [2024-11-11 20:50:44,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:44,027 INFO L225 Difference]: With dead ends: 620 [2024-11-11 20:50:44,028 INFO L226 Difference]: Without dead ends: 405 [2024-11-11 20:50:44,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:50:44,034 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 1 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:44,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1204 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:50:44,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-11 20:50:44,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 404. [2024-11-11 20:50:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 312 states have (on average 1.544871794871795) internal successors, (482), 316 states have internal predecessors, (482), 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) [2024-11-11 20:50:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 607 transitions. [2024-11-11 20:50:44,074 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 607 transitions. Word has length 111 [2024-11-11 20:50:44,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:44,075 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 607 transitions. [2024-11-11 20:50:44,075 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) [2024-11-11 20:50:44,075 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 607 transitions. [2024-11-11 20:50:44,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-11 20:50:44,080 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:44,081 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] [2024-11-11 20:50:44,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 20:50:44,281 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 [2024-11-11 20:50:44,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:44,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:44,282 INFO L85 PathProgramCache]: Analyzing trace with hash 31342431, now seen corresponding path program 1 times [2024-11-11 20:50:44,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:44,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175045529] [2024-11-11 20:50:44,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:44,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:50:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:50:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:50:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 20:50:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:50:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:50:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:50:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:50:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:50:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:50:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:50:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:50:44,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:44,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175045529] [2024-11-11 20:50:44,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175045529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:50:44,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87785057] [2024-11-11 20:50:44,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:44,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:50:44,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:50:44,584 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) [2024-11-11 20:50:44,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 20:50:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 1080 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:50:44,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:50:44,926 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:50:44,929 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:50:44,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87785057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:44,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:50:44,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:50:44,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416415267] [2024-11-11 20:50:44,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:44,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:50:44,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:44,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:50:44,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:50:44,931 INFO L87 Difference]: Start difference. First operand 404 states and 607 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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) [2024-11-11 20:50:44,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:44,972 INFO L93 Difference]: Finished difference Result 851 states and 1298 transitions. [2024-11-11 20:50:44,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:50:44,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 117 [2024-11-11 20:50:44,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:44,977 INFO L225 Difference]: With dead ends: 851 [2024-11-11 20:50:44,977 INFO L226 Difference]: Without dead ends: 474 [2024-11-11 20:50:44,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:50:44,982 INFO L435 NwaCegarLoop]: 611 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, 1168 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 [2024-11-11 20:50:44,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1168 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:50:44,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-11 20:50:45,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 466. [2024-11-11 20:50:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 360 states have (on average 1.5638888888888889) internal successors, (563), 364 states have internal predecessors, (563), 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) [2024-11-11 20:50:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 716 transitions. [2024-11-11 20:50:45,019 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 716 transitions. Word has length 117 [2024-11-11 20:50:45,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:45,019 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 716 transitions. [2024-11-11 20:50:45,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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) [2024-11-11 20:50:45,020 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 716 transitions. [2024-11-11 20:50:45,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-11 20:50:45,022 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:45,022 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, 1] [2024-11-11 20:50:45,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 20:50:45,223 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 [2024-11-11 20:50:45,224 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:45,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:45,224 INFO L85 PathProgramCache]: Analyzing trace with hash -966711120, now seen corresponding path program 1 times [2024-11-11 20:50:45,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:45,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018149350] [2024-11-11 20:50:45,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:45,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:50:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:50:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:50:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:50:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:50:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:50:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:50:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:50:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:50:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:50:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:50:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,514 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:50:45,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:45,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018149350] [2024-11-11 20:50:45,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018149350] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:50:45,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427706900] [2024-11-11 20:50:45,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:45,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:50:45,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:50:45,518 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) [2024-11-11 20:50:45,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 20:50:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 1085 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:50:45,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:50:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:50:45,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:50:45,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427706900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:45,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:50:45,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-11 20:50:45,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85706559] [2024-11-11 20:50:45,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:45,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:50:45,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:45,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:50:45,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:50:45,893 INFO L87 Difference]: Start difference. First operand 466 states and 716 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), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:50:45,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:45,959 INFO L93 Difference]: Finished difference Result 923 states and 1422 transitions. [2024-11-11 20:50:45,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:50:45,960 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), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2024-11-11 20:50:45,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:45,963 INFO L225 Difference]: With dead ends: 923 [2024-11-11 20:50:45,963 INFO L226 Difference]: Without dead ends: 468 [2024-11-11 20:50:45,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:50:45,966 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 2 mSDsluCounter, 1780 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2377 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 [2024-11-11 20:50:45,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2377 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:50:45,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-11 20:50:45,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2024-11-11 20:50:45,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 361 states have (on average 1.5623268698060941) internal successors, (564), 366 states have internal predecessors, (564), 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) [2024-11-11 20:50:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 719 transitions. [2024-11-11 20:50:45,993 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 719 transitions. Word has length 118 [2024-11-11 20:50:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:45,995 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 719 transitions. [2024-11-11 20:50:45,995 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), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:50:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 719 transitions. [2024-11-11 20:50:45,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 20:50:45,998 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:45,998 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, 1] [2024-11-11 20:50:46,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 20:50:46,202 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 [2024-11-11 20:50:46,203 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:46,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:46,203 INFO L85 PathProgramCache]: Analyzing trace with hash -919767989, now seen corresponding path program 1 times [2024-11-11 20:50:46,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:46,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146271194] [2024-11-11 20:50:46,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:46,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:46,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:46,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:46,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:46,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:46,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:50:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:46,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:50:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:46,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:50:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:46,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:50:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:46,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:50:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:46,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:50:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:46,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:50:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:46,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:50:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:46,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:50:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:46,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:50:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:46,496 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:50:46,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:46,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146271194] [2024-11-11 20:50:46,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146271194] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:50:46,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006645768] [2024-11-11 20:50:46,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:46,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:50:46,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:50:46,499 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) [2024-11-11 20:50:46,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 20:50:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:46,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 1086 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 20:50:46,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:50:46,849 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:50:46,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:50:46,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006645768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:46,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:50:46,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-11 20:50:46,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61752196] [2024-11-11 20:50:46,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:46,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:50:46,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:46,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:50:46,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:50:46,855 INFO L87 Difference]: Start difference. First operand 468 states and 719 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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) [2024-11-11 20:50:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:46,927 INFO L93 Difference]: Finished difference Result 925 states and 1427 transitions. [2024-11-11 20:50:46,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:50:46,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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 119 [2024-11-11 20:50:46,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:46,932 INFO L225 Difference]: With dead ends: 925 [2024-11-11 20:50:46,932 INFO L226 Difference]: Without dead ends: 470 [2024-11-11 20:50:46,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:50:46,935 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 2 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2363 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 [2024-11-11 20:50:46,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2363 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:50:46,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-11 20:50:46,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2024-11-11 20:50:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 362 states have (on average 1.5607734806629834) internal successors, (565), 368 states have internal predecessors, (565), 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) [2024-11-11 20:50:46,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 725 transitions. [2024-11-11 20:50:46,966 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 725 transitions. Word has length 119 [2024-11-11 20:50:46,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:46,966 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 725 transitions. [2024-11-11 20:50:46,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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) [2024-11-11 20:50:46,967 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 725 transitions. [2024-11-11 20:50:46,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-11 20:50:46,969 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:46,970 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] [2024-11-11 20:50:46,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 20:50:47,170 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 [2024-11-11 20:50:47,171 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:47,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:47,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1604266393, now seen corresponding path program 1 times [2024-11-11 20:50:47,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:47,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483654843] [2024-11-11 20:50:47,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:47,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:50:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:50:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:50:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:50:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:50:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:50:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:50:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:50:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:50:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,420 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:50:47,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:47,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483654843] [2024-11-11 20:50:47,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483654843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:47,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:47,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:50:47,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672980620] [2024-11-11 20:50:47,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:47,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:50:47,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:47,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:50:47,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:50:47,423 INFO L87 Difference]: Start difference. First operand 470 states and 725 transitions. Second operand has 9 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:50:49,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:49,717 INFO L93 Difference]: Finished difference Result 1020 states and 1592 transitions. [2024-11-11 20:50:49,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:50:49,719 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 6 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 120 [2024-11-11 20:50:49,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:49,724 INFO L225 Difference]: With dead ends: 1020 [2024-11-11 20:50:49,724 INFO L226 Difference]: Without dead ends: 573 [2024-11-11 20:50:49,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:50:49,728 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 1381 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 2548 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 2982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 2548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:49,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 1275 Invalid, 2982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 2548 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 20:50:49,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-11-11 20:50:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 470. [2024-11-11 20:50:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 362 states have (on average 1.5607734806629834) internal successors, (565), 368 states have internal predecessors, (565), 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) [2024-11-11 20:50:49,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 724 transitions. [2024-11-11 20:50:49,776 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 724 transitions. Word has length 120 [2024-11-11 20:50:49,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:49,777 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 724 transitions. [2024-11-11 20:50:49,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:50:49,777 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 724 transitions. [2024-11-11 20:50:49,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-11 20:50:49,779 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:49,779 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] [2024-11-11 20:50:49,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:50:49,780 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:49,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:49,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1575919260, now seen corresponding path program 2 times [2024-11-11 20:50:49,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:49,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495826510] [2024-11-11 20:50:49,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:49,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:49,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:49,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:49,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:49,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:49,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:50:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:50:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:50:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:50:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:50:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:50:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:50:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:50:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:50:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:50:50,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:50,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495826510] [2024-11-11 20:50:50,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495826510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:50,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:50,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:50:50,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94084169] [2024-11-11 20:50:50,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:50,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:50:50,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:50,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:50:50,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:50:50,046 INFO L87 Difference]: Start difference. First operand 470 states and 724 transitions. Second operand has 9 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:50:52,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:52,264 INFO L93 Difference]: Finished difference Result 1022 states and 1595 transitions. [2024-11-11 20:50:52,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:50:52,264 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 6 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 121 [2024-11-11 20:50:52,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:52,272 INFO L225 Difference]: With dead ends: 1022 [2024-11-11 20:50:52,273 INFO L226 Difference]: Without dead ends: 575 [2024-11-11 20:50:52,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:50:52,276 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 1388 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 2487 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1389 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 2931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:52,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1389 Valid, 1274 Invalid, 2931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2487 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-11 20:50:52,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-11-11 20:50:52,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 472. [2024-11-11 20:50:52,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 363 states have (on average 1.559228650137741) internal successors, (566), 370 states have internal predecessors, (566), 77 states have call successors, (77), 28 states have call predecessors, (77), 31 states have return successors, (84), 75 states have call predecessors, (84), 76 states have call successors, (84) [2024-11-11 20:50:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 727 transitions. [2024-11-11 20:50:52,325 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 727 transitions. Word has length 121 [2024-11-11 20:50:52,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:52,326 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 727 transitions. [2024-11-11 20:50:52,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:50:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 727 transitions. [2024-11-11 20:50:52,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-11 20:50:52,329 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:52,329 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] [2024-11-11 20:50:52,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:50:52,329 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:52,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:52,330 INFO L85 PathProgramCache]: Analyzing trace with hash 848855842, now seen corresponding path program 1 times [2024-11-11 20:50:52,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:52,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252951953] [2024-11-11 20:50:52,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:52,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:52,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:52,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:52,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:52,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:52,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:52,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:50:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:52,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:50:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:52,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:50:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:52,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:50:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:52,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:50:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:52,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:50:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:52,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:50:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:52,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:50:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:52,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:50:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:50:52,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:52,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252951953] [2024-11-11 20:50:52,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252951953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:52,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:52,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:50:52,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460214738] [2024-11-11 20:50:52,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:52,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:50:52,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:52,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:50:52,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:50:52,645 INFO L87 Difference]: Start difference. First operand 472 states and 727 transitions. Second operand has 12 states, 11 states have (on average 7.545454545454546) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-11 20:50:55,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:55,446 INFO L93 Difference]: Finished difference Result 1020 states and 1590 transitions. [2024-11-11 20:50:55,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:50:55,446 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.545454545454546) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 122 [2024-11-11 20:50:55,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:55,450 INFO L225 Difference]: With dead ends: 1020 [2024-11-11 20:50:55,450 INFO L226 Difference]: Without dead ends: 575 [2024-11-11 20:50:55,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-11 20:50:55,453 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 1392 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 4188 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1393 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 4632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 4188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:55,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1393 Valid, 1767 Invalid, 4632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 4188 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 20:50:55,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-11-11 20:50:55,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 472. [2024-11-11 20:50:55,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 363 states have (on average 1.559228650137741) internal successors, (566), 370 states have internal predecessors, (566), 77 states have call successors, (77), 28 states have call predecessors, (77), 31 states have return successors, (83), 75 states have call predecessors, (83), 76 states have call successors, (83) [2024-11-11 20:50:55,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 726 transitions. [2024-11-11 20:50:55,515 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 726 transitions. Word has length 122 [2024-11-11 20:50:55,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:55,516 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 726 transitions. [2024-11-11 20:50:55,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.545454545454546) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-11 20:50:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 726 transitions. [2024-11-11 20:50:55,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 20:50:55,519 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:55,519 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, 1] [2024-11-11 20:50:55,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:50:55,520 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:55,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:55,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2108958628, now seen corresponding path program 2 times [2024-11-11 20:50:55,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:55,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107926433] [2024-11-11 20:50:55,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:55,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:55,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:55,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:55,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:55,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:55,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:55,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:50:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:55,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:50:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:55,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 20:50:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:55,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:50:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:55,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:50:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:55,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:50:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:55,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:50:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:55,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:50:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:55,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:50:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:50:55,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:55,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107926433] [2024-11-11 20:50:55,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107926433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:55,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:55,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:50:55,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184910906] [2024-11-11 20:50:55,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:55,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:50:55,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:55,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:50:55,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:50:55,842 INFO L87 Difference]: Start difference. First operand 472 states and 726 transitions. Second operand has 12 states, 11 states have (on average 7.636363636363637) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-11 20:50:58,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:58,383 INFO L93 Difference]: Finished difference Result 1022 states and 1596 transitions. [2024-11-11 20:50:58,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:50:58,384 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.636363636363637) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 123 [2024-11-11 20:50:58,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:58,388 INFO L225 Difference]: With dead ends: 1022 [2024-11-11 20:50:58,389 INFO L226 Difference]: Without dead ends: 577 [2024-11-11 20:50:58,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-11 20:50:58,391 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 1415 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 4087 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 4573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 4087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:58,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1416 Valid, 1767 Invalid, 4573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 4087 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-11 20:50:58,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-11 20:50:58,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 474. [2024-11-11 20:50:58,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 364 states have (on average 1.5576923076923077) internal successors, (567), 372 states have internal predecessors, (567), 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) [2024-11-11 20:50:58,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 732 transitions. [2024-11-11 20:50:58,429 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 732 transitions. Word has length 123 [2024-11-11 20:50:58,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:58,429 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 732 transitions. [2024-11-11 20:50:58,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.636363636363637) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-11 20:50:58,430 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 732 transitions. [2024-11-11 20:50:58,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-11 20:50:58,432 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:58,432 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, 1] [2024-11-11 20:50:58,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:50:58,433 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:58,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:58,433 INFO L85 PathProgramCache]: Analyzing trace with hash -338816835, now seen corresponding path program 1 times [2024-11-11 20:50:58,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:58,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714141769] [2024-11-11 20:50:58,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:58,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:58,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:58,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:58,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:58,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:58,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:58,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:50:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:58,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:50:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:58,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:50:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:58,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:50:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:58,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:50:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:58,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:50:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:58,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:50:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:58,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:50:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:58,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:50:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:50:58,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:58,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714141769] [2024-11-11 20:50:58,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714141769] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:50:58,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153300795] [2024-11-11 20:50:58,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:58,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:50:58,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:50:58,624 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) [2024-11-11 20:50:58,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 20:50:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:58,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:50:58,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:50:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:50:58,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:50:59,063 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:50:59,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153300795] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:50:59,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:50:59,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-11-11 20:50:59,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124688322] [2024-11-11 20:50:59,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:50:59,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:50:59,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:59,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:50:59,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:50:59,066 INFO L87 Difference]: Start difference. First operand 474 states and 732 transitions. Second operand has 11 states, 11 states have (on average 10.909090909090908) internal successors, (120), 7 states have internal predecessors, (120), 2 states have call successors, (34), 6 states have call predecessors, (34), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-11 20:51:00,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:51:00,983 INFO L93 Difference]: Finished difference Result 1209 states and 1965 transitions. [2024-11-11 20:51:00,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:51:00,984 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.909090909090908) internal successors, (120), 7 states have internal predecessors, (120), 2 states have call successors, (34), 6 states have call predecessors, (34), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 124 [2024-11-11 20:51:00,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:51:00,990 INFO L225 Difference]: With dead ends: 1209 [2024-11-11 20:51:00,991 INFO L226 Difference]: Without dead ends: 994 [2024-11-11 20:51:00,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:51:00,993 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 1905 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 2129 mSolverCounterSat, 627 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1962 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 2756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 627 IncrementalHoareTripleChecker+Valid, 2129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:51:00,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1962 Valid, 1734 Invalid, 2756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [627 Valid, 2129 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 20:51:00,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2024-11-11 20:51:01,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 867. [2024-11-11 20:51:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 678 states have (on average 1.6224188790560472) internal successors, (1100), 686 states have internal predecessors, (1100), 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) [2024-11-11 20:51:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1433 transitions. [2024-11-11 20:51:01,046 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1433 transitions. Word has length 124 [2024-11-11 20:51:01,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:51:01,046 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1433 transitions. [2024-11-11 20:51:01,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.909090909090908) internal successors, (120), 7 states have internal predecessors, (120), 2 states have call successors, (34), 6 states have call predecessors, (34), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-11 20:51:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1433 transitions. [2024-11-11 20:51:01,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-11 20:51:01,051 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:51:01,051 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] [2024-11-11 20:51:01,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 20:51:01,252 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 [2024-11-11 20:51:01,252 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:51:01,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:51:01,253 INFO L85 PathProgramCache]: Analyzing trace with hash 356156352, now seen corresponding path program 1 times [2024-11-11 20:51:01,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:51:01,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516444658] [2024-11-11 20:51:01,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:51:01,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:51:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:01,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:51:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:01,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:51:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:01,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:51:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:01,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:51:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:01,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:51:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:01,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:51:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:01,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:51:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:01,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:51:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:01,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:51:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:01,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:51:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:01,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:51:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:01,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:51:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:01,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:51:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:01,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:51:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:01,385 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:51:01,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:51:01,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516444658] [2024-11-11 20:51:01,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516444658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:51:01,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:51:01,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:51:01,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718931155] [2024-11-11 20:51:01,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:51:01,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:51:01,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:51:01,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:51:01,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:51:01,388 INFO L87 Difference]: Start difference. First operand 867 states and 1433 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:51:02,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:51:02,824 INFO L93 Difference]: Finished difference Result 2167 states and 3670 transitions. [2024-11-11 20:51:02,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:51:02,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 6 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 [2024-11-11 20:51:02,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:51:02,832 INFO L225 Difference]: With dead ends: 2167 [2024-11-11 20:51:02,833 INFO L226 Difference]: Without dead ends: 1368 [2024-11-11 20:51:02,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:51:02,837 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 1509 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 1920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:51:02,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 966 Invalid, 1920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:51:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2024-11-11 20:51:02,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1257. [2024-11-11 20:51:02,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 989 states have (on average 1.6380182002022246) internal successors, (1620), 997 states have internal predecessors, (1620), 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) [2024-11-11 20:51:02,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 2121 transitions. [2024-11-11 20:51:02,906 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 2121 transitions. Word has length 130 [2024-11-11 20:51:02,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:51:02,907 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 2121 transitions. [2024-11-11 20:51:02,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:51:02,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 2121 transitions. [2024-11-11 20:51:02,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-11 20:51:02,914 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:51:02,915 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] [2024-11-11 20:51:02,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:51:02,915 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:51:02,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:51:02,916 INFO L85 PathProgramCache]: Analyzing trace with hash 366727282, now seen corresponding path program 1 times [2024-11-11 20:51:02,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:51:02,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320974351] [2024-11-11 20:51:02,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:51:02,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:51:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:02,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:51:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:02,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:51:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:02,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:51:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:03,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:51:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:03,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:51:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:03,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:51:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:03,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:51:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:03,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:51:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:03,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:51:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:03,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:51:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:03,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:51:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:03,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:51:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:03,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:51:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:03,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 20:51:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:51:03,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:51:03,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320974351] [2024-11-11 20:51:03,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320974351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:51:03,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:51:03,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:51:03,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120972081] [2024-11-11 20:51:03,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:51:03,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:51:03,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:51:03,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:51:03,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:51:03,042 INFO L87 Difference]: Start difference. First operand 1257 states and 2121 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:51:04,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:51:04,595 INFO L93 Difference]: Finished difference Result 3116 states and 5344 transitions. [2024-11-11 20:51:04,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:51:04,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 6 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 [2024-11-11 20:51:04,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:51:04,609 INFO L225 Difference]: With dead ends: 3116 [2024-11-11 20:51:04,610 INFO L226 Difference]: Without dead ends: 1980 [2024-11-11 20:51:04,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:51:04,617 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 1465 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:51:04,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 949 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 20:51:04,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2024-11-11 20:51:04,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1869. [2024-11-11 20:51:04,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1482 states have (on average 1.6484480431848854) internal successors, (2443), 1490 states have internal predecessors, (2443), 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) [2024-11-11 20:51:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 3182 transitions. [2024-11-11 20:51:04,708 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 3182 transitions. Word has length 131 [2024-11-11 20:51:04,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:51:04,709 INFO L471 AbstractCegarLoop]: Abstraction has 1869 states and 3182 transitions. [2024-11-11 20:51:04,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:51:04,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 3182 transitions. [2024-11-11 20:51:04,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-11 20:51:04,720 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:51:04,720 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] [2024-11-11 20:51:04,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:51:04,721 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:51:04,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:51:04,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1668270942, now seen corresponding path program 1 times [2024-11-11 20:51:04,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:51:04,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976692789] [2024-11-11 20:51:04,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:51:04,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:51:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:04,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:51:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:04,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:51:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:04,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:51:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:04,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:51:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:04,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:51:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:04,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:51:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:04,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:51:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:04,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:51:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:04,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:51:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:04,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:51:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:04,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:51:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:04,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:51:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:04,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:51:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:04,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 20:51:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:04,843 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:51:04,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:51:04,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976692789] [2024-11-11 20:51:04,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976692789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:51:04,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:51:04,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:51:04,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001425024] [2024-11-11 20:51:04,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:51:04,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:51:04,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:51:04,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:51:04,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:51:04,846 INFO L87 Difference]: Start difference. First operand 1869 states and 3182 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:51:06,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:51:06,251 INFO L93 Difference]: Finished difference Result 4541 states and 7878 transitions. [2024-11-11 20:51:06,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:51:06,252 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 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 [2024-11-11 20:51:06,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:51:06,269 INFO L225 Difference]: With dead ends: 4541 [2024-11-11 20:51:06,269 INFO L226 Difference]: Without dead ends: 2918 [2024-11-11 20:51:06,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:51:06,279 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 1513 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 1872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:51:06,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1533 Valid, 933 Invalid, 1872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [505 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:51:06,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2024-11-11 20:51:06,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 2807. [2024-11-11 20:51:06,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2807 states, 2258 states have (on average 1.6567759078830824) internal successors, (3741), 2266 states have internal predecessors, (3741), 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) [2024-11-11 20:51:06,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 4820 transitions. [2024-11-11 20:51:06,428 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 4820 transitions. Word has length 132 [2024-11-11 20:51:06,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:51:06,429 INFO L471 AbstractCegarLoop]: Abstraction has 2807 states and 4820 transitions. [2024-11-11 20:51:06,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:51:06,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 4820 transitions. [2024-11-11 20:51:06,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-11 20:51:06,443 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:51:06,443 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] [2024-11-11 20:51:06,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:51:06,443 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:51:06,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:51:06,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1177919247, now seen corresponding path program 1 times [2024-11-11 20:51:06,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:51:06,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668309613] [2024-11-11 20:51:06,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:51:06,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:51:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:06,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:51:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:06,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:51:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:06,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:51:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:06,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:51:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:06,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:51:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:06,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:51:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:06,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:51:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:06,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:51:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:06,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:51:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:06,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:51:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:06,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:51:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:06,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:51:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:06,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 20:51:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:06,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 20:51:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:06,569 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:51:06,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:51:06,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668309613] [2024-11-11 20:51:06,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668309613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:51:06,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:51:06,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:51:06,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399504542] [2024-11-11 20:51:06,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:51:06,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:51:06,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:51:06,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:51:06,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:51:06,572 INFO L87 Difference]: Start difference. First operand 2807 states and 4820 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:51:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:51:08,123 INFO L93 Difference]: Finished difference Result 6790 states and 11887 transitions. [2024-11-11 20:51:08,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:51:08,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 6 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 [2024-11-11 20:51:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:51:08,151 INFO L225 Difference]: With dead ends: 6790 [2024-11-11 20:51:08,151 INFO L226 Difference]: Without dead ends: 4433 [2024-11-11 20:51:08,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:51:08,162 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 1470 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 488 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:51:08,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1489 Valid, 932 Invalid, 1893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [488 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 20:51:08,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4433 states. [2024-11-11 20:51:08,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4433 to 4322. [2024-11-11 20:51:08,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4322 states, 3528 states have (on average 1.6626984126984128) internal successors, (5866), 3536 states have internal predecessors, (5866), 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) [2024-11-11 20:51:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4322 states to 4322 states and 7461 transitions. [2024-11-11 20:51:08,358 INFO L78 Accepts]: Start accepts. Automaton has 4322 states and 7461 transitions. Word has length 133 [2024-11-11 20:51:08,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:51:08,359 INFO L471 AbstractCegarLoop]: Abstraction has 4322 states and 7461 transitions. [2024-11-11 20:51:08,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:51:08,359 INFO L276 IsEmpty]: Start isEmpty. Operand 4322 states and 7461 transitions. [2024-11-11 20:51:08,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-11 20:51:08,378 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:51:08,378 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] [2024-11-11 20:51:08,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:51:08,379 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:51:08,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:51:08,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1715203874, now seen corresponding path program 1 times [2024-11-11 20:51:08,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:51:08,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696202255] [2024-11-11 20:51:08,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:51:08,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:51:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:08,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:51:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:08,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:51:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:08,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:51:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:08,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:51:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:08,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:51:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:08,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:51:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:08,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:51:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:08,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:51:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:08,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:51:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:08,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:51:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:08,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:51:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:08,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:51:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:08,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 20:51:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:08,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-11 20:51:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:08,548 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:51:08,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:51:08,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696202255] [2024-11-11 20:51:08,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696202255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:51:08,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:51:08,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:51:08,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454987014] [2024-11-11 20:51:08,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:51:08,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:51:08,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:51:08,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:51:08,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:51:08,551 INFO L87 Difference]: Start difference. First operand 4322 states and 7461 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:51:10,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:51:10,022 INFO L93 Difference]: Finished difference Result 10806 states and 18999 transitions. [2024-11-11 20:51:10,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:51:10,023 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 6 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 [2024-11-11 20:51:10,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:51:10,072 INFO L225 Difference]: With dead ends: 10806 [2024-11-11 20:51:10,072 INFO L226 Difference]: Without dead ends: 7166 [2024-11-11 20:51:10,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:51:10,086 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 1481 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:51:10,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 977 Invalid, 1919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 1408 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:51:10,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7166 states. [2024-11-11 20:51:10,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7166 to 7055. [2024-11-11 20:51:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7055 states, 5768 states have (on average 1.6593273231622747) internal successors, (9571), 5776 states have internal predecessors, (9571), 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) [2024-11-11 20:51:10,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7055 states to 7055 states and 12196 transitions. [2024-11-11 20:51:10,380 INFO L78 Accepts]: Start accepts. Automaton has 7055 states and 12196 transitions. Word has length 134 [2024-11-11 20:51:10,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:51:10,380 INFO L471 AbstractCegarLoop]: Abstraction has 7055 states and 12196 transitions. [2024-11-11 20:51:10,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:51:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 7055 states and 12196 transitions. [2024-11-11 20:51:10,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-11 20:51:10,406 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:51:10,406 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] [2024-11-11 20:51:10,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 20:51:10,406 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:51:10,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:51:10,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1533216467, now seen corresponding path program 1 times [2024-11-11 20:51:10,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:51:10,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184271503] [2024-11-11 20:51:10,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:51:10,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:51:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:10,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:51:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:10,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:51:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:10,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:51:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:10,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:51:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:10,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:51:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:10,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:51:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:10,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:51:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:10,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:51:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:10,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:51:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:10,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:51:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:10,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:51:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:10,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:51:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:10,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-11 20:51:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:10,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 20:51:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:51:10,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:51:10,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184271503] [2024-11-11 20:51:10,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184271503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:51:10,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:51:10,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:51:10,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078143234] [2024-11-11 20:51:10,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:51:10,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:51:10,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:51:10,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:51:10,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:51:10,616 INFO L87 Difference]: Start difference. First operand 7055 states and 12196 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:51:12,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:51:12,092 INFO L93 Difference]: Finished difference Result 17946 states and 31571 transitions. [2024-11-11 20:51:12,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:51:12,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 6 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 [2024-11-11 20:51:12,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:51:12,149 INFO L225 Difference]: With dead ends: 17946 [2024-11-11 20:51:12,150 INFO L226 Difference]: Without dead ends: 11950 [2024-11-11 20:51:12,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:51:12,175 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 1531 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:51:12,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 967 Invalid, 1895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:51:12,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11950 states. [2024-11-11 20:51:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11950 to 11839. [2024-11-11 20:51:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11839 states, 9730 states have (on average 1.6597122302158274) internal successors, (16149), 9738 states have internal predecessors, (16149), 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) [2024-11-11 20:51:12,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11839 states to 11839 states and 20496 transitions. [2024-11-11 20:51:12,804 INFO L78 Accepts]: Start accepts. Automaton has 11839 states and 20496 transitions. Word has length 135 [2024-11-11 20:51:12,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:51:12,805 INFO L471 AbstractCegarLoop]: Abstraction has 11839 states and 20496 transitions. [2024-11-11 20:51:12,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:51:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 11839 states and 20496 transitions. [2024-11-11 20:51:12,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-11 20:51:12,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:51:12,845 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] [2024-11-11 20:51:12,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 20:51:12,845 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:51:12,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:51:12,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1363427552, now seen corresponding path program 1 times [2024-11-11 20:51:12,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:51:12,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130638652] [2024-11-11 20:51:12,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:51:12,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:51:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:12,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:51:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:12,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:51:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:12,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:51:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:12,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:51:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:12,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:51:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:12,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:51:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:12,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:51:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:12,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:51:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:12,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:51:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:12,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:51:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:12,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:51:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:12,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:51:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:12,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 20:51:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:12,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-11 20:51:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:51:12,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:51:12,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130638652] [2024-11-11 20:51:12,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130638652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:51:12,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:51:12,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:51:12,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858787165] [2024-11-11 20:51:12,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:51:12,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:51:12,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:51:12,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:51:12,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:51:12,977 INFO L87 Difference]: Start difference. First operand 11839 states and 20496 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:51:14,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:51:14,542 INFO L93 Difference]: Finished difference Result 28379 states and 49696 transitions. [2024-11-11 20:51:14,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:51:14,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 6 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 [2024-11-11 20:51:14,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:51:14,725 INFO L225 Difference]: With dead ends: 28379 [2024-11-11 20:51:14,726 INFO L226 Difference]: Without dead ends: 18543 [2024-11-11 20:51:14,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:51:14,756 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 1477 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 1906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:51:14,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 940 Invalid, 1906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 1432 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:51:14,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18543 states. [2024-11-11 20:51:15,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18543 to 18432. [2024-11-11 20:51:15,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18432 states, 15120 states have (on average 1.634589947089947) internal successors, (24715), 15128 states have internal predecessors, (24715), 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) [2024-11-11 20:51:15,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18432 states to 18432 states and 31612 transitions. [2024-11-11 20:51:15,512 INFO L78 Accepts]: Start accepts. Automaton has 18432 states and 31612 transitions. Word has length 136 [2024-11-11 20:51:15,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:51:15,513 INFO L471 AbstractCegarLoop]: Abstraction has 18432 states and 31612 transitions. [2024-11-11 20:51:15,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:51:15,513 INFO L276 IsEmpty]: Start isEmpty. Operand 18432 states and 31612 transitions. [2024-11-11 20:51:15,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-11 20:51:15,544 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:51:15,544 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] [2024-11-11 20:51:15,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 20:51:15,545 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:51:15,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:51:15,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1582070284, now seen corresponding path program 1 times [2024-11-11 20:51:15,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:51:15,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288692058] [2024-11-11 20:51:15,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:51:15,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:51:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:15,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:51:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:15,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:51:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:15,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:51:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:15,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:51:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:15,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:51:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:15,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:51:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:15,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:51:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:15,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:51:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:15,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:51:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:15,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:51:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:15,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:51:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:15,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:51:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:15,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:51:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:15,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-11 20:51:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:15,660 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:51:15,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:51:15,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288692058] [2024-11-11 20:51:15,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288692058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:51:15,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:51:15,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:51:15,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047057245] [2024-11-11 20:51:15,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:51:15,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:51:15,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:51:15,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:51:15,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:51:15,663 INFO L87 Difference]: Start difference. First operand 18432 states and 31612 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:51:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:51:17,897 INFO L93 Difference]: Finished difference Result 48801 states and 85200 transitions. [2024-11-11 20:51:17,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:51:17,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 6 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 [2024-11-11 20:51:17,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:51:18,042 INFO L225 Difference]: With dead ends: 48801 [2024-11-11 20:51:18,042 INFO L226 Difference]: Without dead ends: 32979 [2024-11-11 20:51:18,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:51:18,087 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 1506 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 1875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:51:18,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 934 Invalid, 1875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:51:18,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32979 states. [2024-11-11 20:51:19,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32979 to 32868. [2024-11-11 20:51:19,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32868 states, 27106 states have (on average 1.6314469121227773) internal successors, (44222), 27114 states have internal predecessors, (44222), 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) [2024-11-11 20:51:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32868 states to 32868 states and 56293 transitions. [2024-11-11 20:51:19,385 INFO L78 Accepts]: Start accepts. Automaton has 32868 states and 56293 transitions. Word has length 137 [2024-11-11 20:51:19,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:51:19,385 INFO L471 AbstractCegarLoop]: Abstraction has 32868 states and 56293 transitions. [2024-11-11 20:51:19,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:51:19,385 INFO L276 IsEmpty]: Start isEmpty. Operand 32868 states and 56293 transitions. [2024-11-11 20:51:19,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-11 20:51:19,424 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:51:19,424 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] [2024-11-11 20:51:19,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 20:51:19,425 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:51:19,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:51:19,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1440653178, now seen corresponding path program 1 times [2024-11-11 20:51:19,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:51:19,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081990639] [2024-11-11 20:51:19,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:51:19,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:51:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:19,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:51:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:19,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:51:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:19,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:51:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:19,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:51:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:19,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:51:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:19,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:51:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:19,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:51:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:19,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:51:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:19,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:51:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:19,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:51:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:19,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:51:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:19,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:51:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:19,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 20:51:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:19,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-11 20:51:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:51:19,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:51:19,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081990639] [2024-11-11 20:51:19,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081990639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:51:19,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:51:19,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:51:19,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348685034] [2024-11-11 20:51:19,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:51:19,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:51:19,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:51:19,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:51:19,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:51:19,547 INFO L87 Difference]: Start difference. First operand 32868 states and 56293 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:51:22,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:51:22,613 INFO L93 Difference]: Finished difference Result 89698 states and 155834 transitions. [2024-11-11 20:51:22,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:51:22,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 6 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 [2024-11-11 20:51:22,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:51:22,954 INFO L225 Difference]: With dead ends: 89698 [2024-11-11 20:51:22,954 INFO L226 Difference]: Without dead ends: 60316 [2024-11-11 20:51:23,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:51:23,033 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 1468 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:51:23,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1487 Valid, 944 Invalid, 1901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 20:51:23,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60316 states. [2024-11-11 20:51:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60316 to 60205. [2024-11-11 20:51:25,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60205 states, 49930 states have (on average 1.6271780492689765) internal successors, (81245), 49938 states have internal predecessors, (81245), 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) [2024-11-11 20:51:25,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60205 states to 60205 states and 102874 transitions. [2024-11-11 20:51:25,478 INFO L78 Accepts]: Start accepts. Automaton has 60205 states and 102874 transitions. Word has length 138 [2024-11-11 20:51:25,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:51:25,479 INFO L471 AbstractCegarLoop]: Abstraction has 60205 states and 102874 transitions. [2024-11-11 20:51:25,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:51:25,479 INFO L276 IsEmpty]: Start isEmpty. Operand 60205 states and 102874 transitions. [2024-11-11 20:51:25,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-11 20:51:25,522 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:51:25,522 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] [2024-11-11 20:51:25,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 20:51:25,523 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:51:25,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:51:25,523 INFO L85 PathProgramCache]: Analyzing trace with hash -711063828, now seen corresponding path program 1 times [2024-11-11 20:51:25,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:51:25,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134390695] [2024-11-11 20:51:25,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:51:25,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:51:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:25,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:51:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:25,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:51:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:25,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:51:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:25,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:51:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:25,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:51:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:25,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:51:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:25,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:51:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:25,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:51:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:25,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:51:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:25,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:51:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:25,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:51:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:25,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:51:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:25,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 20:51:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:25,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 20:51:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:25,631 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:51:25,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:51:25,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134390695] [2024-11-11 20:51:25,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134390695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:51:25,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:51:25,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:51:25,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624955456] [2024-11-11 20:51:25,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:51:25,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:51:25,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:51:25,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:51:25,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:51:25,633 INFO L87 Difference]: Start difference. First operand 60205 states and 102874 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:51:29,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:51:29,465 INFO L93 Difference]: Finished difference Result 112789 states and 196412 transitions. [2024-11-11 20:51:29,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:51:29,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 6 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 139 [2024-11-11 20:51:29,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:51:30,101 INFO L225 Difference]: With dead ends: 112789 [2024-11-11 20:51:30,102 INFO L226 Difference]: Without dead ends: 112574 [2024-11-11 20:51:30,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:51:30,174 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 1504 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 1877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:51:30,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 973 Invalid, 1877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [525 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 20:51:30,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112574 states. [2024-11-11 20:51:33,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112574 to 112463. [2024-11-11 20:51:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112463 states, 93820 states have (on average 1.6217437646557238) internal successors, (152152), 93828 states have internal predecessors, (152152), 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) [2024-11-11 20:51:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112463 states to 112463 states and 191563 transitions. [2024-11-11 20:51:34,948 INFO L78 Accepts]: Start accepts. Automaton has 112463 states and 191563 transitions. Word has length 139 [2024-11-11 20:51:34,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:51:34,949 INFO L471 AbstractCegarLoop]: Abstraction has 112463 states and 191563 transitions. [2024-11-11 20:51:34,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:51:34,949 INFO L276 IsEmpty]: Start isEmpty. Operand 112463 states and 191563 transitions. [2024-11-11 20:51:35,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-11 20:51:35,007 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:51:35,007 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, 1] [2024-11-11 20:51:35,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 20:51:35,007 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:51:35,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:51:35,008 INFO L85 PathProgramCache]: Analyzing trace with hash 737463079, now seen corresponding path program 1 times [2024-11-11 20:51:35,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:51:35,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643779446] [2024-11-11 20:51:35,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:51:35,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:51:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:35,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:51:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:35,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:51:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:35,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:51:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:35,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:51:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:35,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:51:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:35,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:51:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:35,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:51:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:35,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:51:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:35,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:51:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:35,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:51:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:35,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:51:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:35,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:51:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:35,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 20:51:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:35,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 20:51:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:35,442 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:51:35,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:51:35,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643779446] [2024-11-11 20:51:35,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643779446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:51:35,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:51:35,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-11 20:51:35,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120365953] [2024-11-11 20:51:35,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:51:35,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-11 20:51:35,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:51:35,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-11 20:51:35,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:51:35,444 INFO L87 Difference]: Start difference. First operand 112463 states and 191563 transitions. Second operand has 18 states, 16 states have (on average 6.0) internal successors, (96), 12 states have internal predecessors, (96), 6 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-11 20:51:47,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:51:47,066 INFO L93 Difference]: Finished difference Result 224592 states and 394476 transitions. [2024-11-11 20:51:47,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-11 20:51:47,067 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 12 states have internal predecessors, (96), 6 states have call successors, (17), 7 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 140 [2024-11-11 20:51:47,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted.